Base | Representation |
---|---|
bin | 1001010001110010001000… |
… | …1101001100001101000001 |
3 | 1100010012212200021100221120 |
4 | 2110130202031030031001 |
5 | 2314113344012224301 |
6 | 33410155210342453 |
7 | 2102002202416524 |
oct | 224344215141501 |
9 | 40105780240846 |
10 | 10201121211201 |
11 | 32832a8a87848 |
12 | 1189066a2aa29 |
13 | 58cc66843b7b |
14 | 273a460b0bbb |
15 | 12a54ba3ce36 |
hex | 9472234c341 |
10201121211201 has 32 divisors (see below), whose sum is σ = 14593638948480. Its totient is φ = 6318591552000.
The previous prime is 10201121211161. The next prime is 10201121211227. The reversal of 10201121211201 is 10211212110201.
It is a happy number.
It is not a de Polignac number, because 10201121211201 - 227 = 10200986993473 is a prime.
It is a super-2 number, since 2×102011212112012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10201121211101) 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, 6483901 + ... + 7902101.
It is an arithmetic number, because the mean of its divisors is an integer number (456051217140).
Almost surely, 210201121211201 is an apocalyptic number.
It is an amenable number.
10201121211201 is a deficient number, since it is larger than the sum of its proper divisors (4392517737279).
10201121211201 is a wasteful number, since it uses less digits than its factorization.
10201121211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1420657.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10201121211201 its reverse (10211212110201), we get a palindrome (20412333321402).
The spelling of 10201121211201 in words is "ten trillion, two hundred one billion, one hundred twenty-one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •