Base | Representation |
---|---|
bin | 10011110111000011… |
… | …11010001101001101 |
3 | 1000112002020010100112 |
4 | 21323201322031031 |
5 | 133314034440300 |
6 | 4522004405405 |
7 | 525140041313 |
oct | 117341721515 |
9 | 30462203315 |
10 | 10662421325 |
11 | 4581727a56 |
12 | 20969a6865 |
13 | 100c00015a |
14 | 7321180b3 |
15 | 42610ae35 |
hex | 27b87a34d |
10662421325 has 24 divisors (see below), whose sum is σ = 13667101440. Its totient is φ = 8243164800.
The previous prime is 10662421321. The next prime is 10662421417. The reversal of 10662421325 is 52312426601.
It is not a de Polignac number, because 10662421325 - 22 = 10662421321 is a prime.
It is a super-2 number, since 2×106624213252 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10662421291 and 10662421300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10662421321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 563417 + ... + 582033.
It is an arithmetic number, because the mean of its divisors is an integer number (569462560).
Almost surely, 210662421325 is an apocalyptic number.
It is an amenable number.
10662421325 is a deficient number, since it is larger than the sum of its proper divisors (3004680115).
10662421325 is a wasteful number, since it uses less digits than its factorization.
10662421325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19397 (or 19392 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 10662421325 its reverse (52312426601), we get a palindrome (62974847926).
The spelling of 10662421325 in words is "ten billion, six hundred sixty-two million, four hundred twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •