Base | Representation |
---|---|
bin | 1001010011100010100100… |
… | …0100110101001000000011 |
3 | 1100020002202222022020012121 |
4 | 2110320221010311020003 |
5 | 2320112201103343412 |
6 | 33432110033105111 |
7 | 2104121116355665 |
oct | 224705104651003 |
9 | 40202688266177 |
10 | 10231301231107 |
11 | 32950858a7460 |
12 | 1192a8a0b8197 |
13 | 592a662b8c08 |
14 | 2752aa3ba535 |
15 | 12b216376107 |
hex | 94e29135203 |
10231301231107 has 32 divisors (see below), whose sum is σ = 11727392440320. Its totient is φ = 8840541540000.
The previous prime is 10231301231087. The next prime is 10231301231153. The reversal of 10231301231107 is 70113210313201.
It is a cyclic number.
It is not a de Polignac number, because 10231301231107 - 211 = 10231301229059 is a prime.
It is a super-2 number, since 2×102313012311072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10231301232107) 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 31 ways as a sum of consecutive naturals, for example, 21960732 + ... + 22421782.
It is an arithmetic number, because the mean of its divisors is an integer number (366481013760).
Almost surely, 210231301231107 is an apocalyptic number.
10231301231107 is a deficient number, since it is larger than the sum of its proper divisors (1496091209213).
10231301231107 is a wasteful number, since it uses less digits than its factorization.
10231301231107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462255.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 10231301231107 its reverse (70113210313201), we get a palindrome (80344511544308).
The spelling of 10231301231107 in words is "ten trillion, two hundred thirty-one billion, three hundred one million, two hundred thirty-one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •