Base | Representation |
---|---|
bin | 10011000011110011… |
… | …00110011010110001 |
3 | 222102010010000001212 |
4 | 21201321212122301 |
5 | 131424000032423 |
6 | 4411204205505 |
7 | 511366112162 |
oct | 114171463261 |
9 | 28363100055 |
10 | 10232424113 |
11 | 4380a3375a |
12 | 1b96999895 |
13 | c70bb7c32 |
14 | 6d0d85769 |
15 | 3ed4be578 |
hex | 261e666b1 |
10232424113 has 2 divisors, whose sum is σ = 10232424114. Its totient is φ = 10232424112.
The previous prime is 10232424109. The next prime is 10232424121. The reversal of 10232424113 is 31142423201.
10232424113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10086787489 + 145636624 = 100433^2 + 12068^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232424113 - 22 = 10232424109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10232424143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116212056 + 5116212057.
It is an arithmetic number, because the mean of its divisors is an integer number (5116212057).
Almost surely, 210232424113 is an apocalyptic number.
It is an amenable number.
10232424113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232424113 is an equidigital number, since it uses as much as digits as its factorization.
10232424113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10232424113 its reverse (31142423201), we get a palindrome (41374847314).
The spelling of 10232424113 in words is "ten billion, two hundred thirty-two million, four hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •