Base | Representation |
---|---|
bin | 11001001111010000110011… |
… | …101100000111100100110001 |
3 | 112120000111101222201212201200 |
4 | 121033100303230013210301 |
5 | 104022111001003014301 |
6 | 1032024410313121413 |
7 | 32244325345342155 |
oct | 3117206354074461 |
9 | 476014358655650 |
10 | 111000002001201 |
11 | 32405922402675 |
12 | 105486640b9269 |
13 | 49c2341abab31 |
14 | 1d5a600749065 |
15 | cc7571221c86 |
hex | 64f433b07931 |
111000002001201 has 12 divisors (see below), whose sum is σ = 160338409350912. Its totient is φ = 73997659890936.
The previous prime is 111000002001137. The next prime is 111000002001271. The reversal of 111000002001201 is 102100200000111.
It is a happy number.
It is not a de Polignac number, because 111000002001201 - 26 = 111000002001137 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 (111000002001271) 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, 194820001 + ... + 195388926.
It is an arithmetic number, because the mean of its divisors is an integer number (13361534112576).
Almost surely, 2111000002001201 is an apocalyptic number.
It is an amenable number.
111000002001201 is a deficient number, since it is larger than the sum of its proper divisors (49338407349711).
111000002001201 is a wasteful number, since it uses less digits than its factorization.
111000002001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390240540 (or 390240537 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111000002001201 its reverse (102100200000111), we get a palindrome (213100202001312).
The spelling of 111000002001201 in words is "one hundred eleven trillion, two million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •