Base | Representation |
---|---|
bin | 101000000100… |
… | …100100100001 |
3 | 201202200102212 |
4 | 220010210201 |
5 | 10142120411 |
6 | 1013051505 |
7 | 155200211 |
oct | 50044441 |
9 | 21680385 |
10 | 10504481 |
11 | 5a25199 |
12 | 3626b95 |
13 | 223a390 |
14 | 1576241 |
15 | dc768b |
hex | a04921 |
10504481 has 8 divisors (see below), whose sum is σ = 11468520. Its totient is φ = 9562752.
The previous prime is 10504477. The next prime is 10504489. The reversal of 10504481 is 18440501.
It can be written as a sum of positive squares in 4 ways, for example, as 400 + 10504081 = 20^2 + 3241^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10504481 - 22 = 10504477 is a prime.
It is a super-2 number, since 2×105044812 = 220688242158722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10504489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4586 + ... + 6483.
It is an arithmetic number, because the mean of its divisors is an integer number (1433565).
Almost surely, 210504481 is an apocalyptic number.
It is an amenable number.
10504481 is a deficient number, since it is larger than the sum of its proper divisors (964039).
10504481 is a wasteful number, since it uses less digits than its factorization.
10504481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11155.
The product of its (nonzero) digits is 640, while the sum is 23.
The square root of 10504481 is about 3241.0617087615. The cubic root of 10504481 is about 219.0071027630.
Adding to 10504481 its reverse (18440501), we get a palindrome (28944982).
The spelling of 10504481 in words is "ten million, five hundred four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •