Base | Representation |
---|---|
bin | 1001010011100010001111… |
… | …0000110100111001010001 |
3 | 1100020002112202120221221222 |
4 | 2110320203300310321101 |
5 | 2320112010244214301 |
6 | 33432053130454425 |
7 | 2104115654646020 |
oct | 224704360647121 |
9 | 40202482527858 |
10 | 10231212101201 |
11 | 329503a55a883 |
12 | 1192a64294415 |
13 | 592a509b0020 |
14 | 27529c6188b7 |
15 | 12b20d61c31b |
hex | 94e23c34e51 |
10231212101201 has 16 divisors (see below), whose sum is σ = 13332982287744. Its totient is φ = 7618847019264.
The previous prime is 10231212101183. The next prime is 10231212101213. The reversal of 10231212101201 is 10210121213201.
It is a happy number.
It is not a de Polignac number, because 10231212101201 - 242 = 5833165590097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10231212101201.
It is not an unprimeable number, because it can be changed into a prime (10231212101251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3306789695 + ... + 3306792788.
It is an arithmetic number, because the mean of its divisors is an integer number (833311392984).
Almost surely, 210231212101201 is an apocalyptic number.
It is an amenable number.
10231212101201 is a deficient number, since it is larger than the sum of its proper divisors (3101770186543).
10231212101201 is a wasteful number, since it uses less digits than its factorization.
10231212101201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6613582520.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10231212101201 its reverse (10210121213201), we get a palindrome (20441333314402).
The spelling of 10231212101201 in words is "ten trillion, two hundred thirty-one billion, two hundred twelve million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •