Base | Representation |
---|---|
bin | 10010110101011100… |
… | …01110010010110001 |
3 | 222002201111212220000 |
4 | 21122232032102301 |
5 | 131202133014301 |
6 | 4351223140213 |
7 | 505404410031 |
oct | 113256162261 |
9 | 28081455800 |
10 | 10112001201 |
11 | 4319a63195 |
12 | 1b625a4669 |
13 | c51c73683 |
14 | 6bcd998c1 |
15 | 3e2b33786 |
hex | 25ab8e4b1 |
10112001201 has 10 divisors (see below), whose sum is σ = 15105582162. Its totient is φ = 6741334080.
The previous prime is 10112001161. The next prime is 10112001223. The reversal of 10112001201 is 10210021101.
It is a happy number.
10112001201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6678158400 + 3433842801 = 81720^2 + 58599^2 .
It is not a de Polignac number, because 10112001201 - 213 = 10111993009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10112001241) 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 9 ways as a sum of consecutive naturals, for example, 62419680 + ... + 62419841.
Almost surely, 210112001201 is an apocalyptic number.
It is an amenable number.
10112001201 is a deficient number, since it is larger than the sum of its proper divisors (4993580961).
10112001201 is an equidigital number, since it uses as much as digits as its factorization.
10112001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124839533 (or 124839524 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10112001201 its reverse (10210021101), we get a palindrome (20322022302).
The spelling of 10112001201 in words is "ten billion, one hundred twelve million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •