Base | Representation |
---|---|
bin | 10010110100001010… |
… | …00011101110100111 |
3 | 222001222012122011202 |
4 | 21122011003232213 |
5 | 131141402210043 |
6 | 4350155553115 |
7 | 505213603622 |
oct | 113205035647 |
9 | 28058178152 |
10 | 10101210023 |
11 | 4313962663 |
12 | 1b5aa5b79b |
13 | c4c965968 |
14 | 6bb78adb9 |
15 | 3e1c011b8 |
hex | 25a143ba7 |
10101210023 has 16 divisors (see below), whose sum is σ = 10716948000. Its totient is φ = 9504337920.
The previous prime is 10101210019. The next prime is 10101210071. The reversal of 10101210023 is 32001210101.
10101210023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10101210023 - 22 = 10101210019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101209986 and 10101210013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101210013) 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, 550883 + ... + 568923.
It is an arithmetic number, because the mean of its divisors is an integer number (669809250).
Almost surely, 210101210023 is an apocalyptic number.
10101210023 is a deficient number, since it is larger than the sum of its proper divisors (615737977).
10101210023 is a wasteful number, since it uses less digits than its factorization.
10101210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18562.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10101210023 its reverse (32001210101), we get a palindrome (42102420124).
The spelling of 10101210023 in words is "ten billion, one hundred one million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •