Base | Representation |
---|---|
bin | 101111011111110111… |
… | …0111110101000000001 |
3 | 100202021121220020120200 |
4 | 1132333232332220001 |
5 | 3132344224324301 |
6 | 114505243355413 |
7 | 10240452201255 |
oct | 1367756765001 |
9 | 322247806520 |
10 | 102001011201 |
11 | 3a292a03471 |
12 | 17927b22b69 |
13 | 980724c13b |
14 | 4d18b00265 |
15 | 29bec4bc86 |
hex | 17bfbbea01 |
102001011201 has 12 divisors (see below), whose sum is σ = 147341166180. Its totient is φ = 67997733120.
The previous prime is 102001011173. The next prime is 102001011209. The reversal of 102001011201 is 102110100201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 62180409600 + 39820601601 = 249360^2 + 199551^2 .
It is not a de Polignac number, because 102001011201 - 217 = 102000880129 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 (102001011209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13960 + ... + 451881.
It is an arithmetic number, because the mean of its divisors is an integer number (12278430515).
Almost surely, 2102001011201 is an apocalyptic number.
It is an amenable number.
102001011201 is a deficient number, since it is larger than the sum of its proper divisors (45340154979).
102001011201 is a wasteful number, since it uses less digits than its factorization.
102001011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490176 (or 490173 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102001011201 its reverse (102110100201), we get a palindrome (204111111402).
The spelling of 102001011201 in words is "one hundred two billion, one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •