Base | Representation |
---|---|
bin | 10010101010111000… |
… | …10010100111011001 |
3 | 221212112211012102012 |
4 | 21111130102213121 |
5 | 131011443223413 |
6 | 4334340315305 |
7 | 503250421010 |
oct | 112534224731 |
9 | 27775735365 |
10 | 10023414233 |
11 | 4283a57518 |
12 | 1b389a2b35 |
13 | c397c7951 |
14 | 6b12d9a77 |
15 | 3d9e857a8 |
hex | 2557129d9 |
10023414233 has 16 divisors (see below), whose sum is σ = 11828342784. Its totient is φ = 8311902480.
The previous prime is 10023414227. The next prime is 10023414259. The reversal of 10023414233 is 33241432001.
10023414233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10023414233 - 26 = 10023414169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10023414199 and 10023414208.
It is not an unprimeable number, because it can be changed into a prime (10013414233) 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 in 15 ways as a sum of consecutive naturals, for example, 1391066 + ... + 1398252.
It is an arithmetic number, because the mean of its divisors is an integer number (739271424).
Almost surely, 210023414233 is an apocalyptic number.
It is an amenable number.
10023414233 is a deficient number, since it is larger than the sum of its proper divisors (1804928551).
10023414233 is an equidigital number, since it uses as much as digits as its factorization.
10023414233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13652.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 10023414233 its reverse (33241432001), we get a palindrome (43264846234).
The spelling of 10023414233 in words is "ten billion, twenty-three million, four hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •