Base | Representation |
---|---|
bin | 10011000011110011… |
… | …01010010011000101 |
3 | 222102010010210212110 |
4 | 21201321222103011 |
5 | 131424001040010 |
6 | 4411204411233 |
7 | 511366206414 |
oct | 114171522305 |
9 | 28363123773 |
10 | 10232440005 |
11 | 4380a44697 |
12 | 1b969a6b19 |
13 | c70bc2238 |
14 | 6d0d8b47b |
15 | 3ed4c4120 |
hex | 261e6a4c5 |
10232440005 has 8 divisors (see below), whose sum is σ = 16371904032. Its totient is φ = 5457301328.
The previous prime is 10232439977. The next prime is 10232440007. The reversal of 10232440005 is 50004423201.
10232440005 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10232440005 - 212 = 10232435909 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232440007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341081319 + ... + 341081348.
It is an arithmetic number, because the mean of its divisors is an integer number (2046488004).
Almost surely, 210232440005 is an apocalyptic number.
10232440005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10232440005 is a deficient number, since it is larger than the sum of its proper divisors (6139464027).
10232440005 is an equidigital number, since it uses as much as digits as its factorization.
10232440005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 682162675.
The product of its (nonzero) digits is 960, while the sum is 21.
Adding to 10232440005 its reverse (50004423201), we get a palindrome (60236863206).
The spelling of 10232440005 in words is "ten billion, two hundred thirty-two million, four hundred forty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.277 sec. • engine limits •