Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …1001100011001000101001 |
3 | 1100010010022001002210121012 |
4 | 2110123212221203020221 |
5 | 2314104322213342301 |
6 | 33405512114153305 |
7 | 2101635350363102 |
oct | 224334651431051 |
9 | 40103261083535 |
10 | 10200122012201 |
11 | 3282935a60850 |
12 | 1188a28282835 |
13 | 58cb37827464 |
14 | 27398d4d13a9 |
15 | 12a4dde68ebb |
hex | 946e6a63229 |
10200122012201 has 8 divisors (see below), whose sum is σ = 11242121356704. Its totient is φ = 9177241921920.
The previous prime is 10200122012191. The next prime is 10200122012231. The reversal of 10200122012201 is 10221022100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10200122012201 - 230 = 10199048270377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200122012231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4779812435 + ... + 4779814568.
It is an arithmetic number, because the mean of its divisors is an integer number (1405265169588).
Almost surely, 210200122012201 is an apocalyptic number.
10200122012201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10200122012201 is a deficient number, since it is larger than the sum of its proper divisors (1041999344503).
10200122012201 is an equidigital number, since it uses as much as digits as its factorization.
10200122012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9559627111.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10200122012201 its reverse (10221022100201), we get a palindrome (20421144112402).
The spelling of 10200122012201 in words is "ten trillion, two hundred billion, one hundred twenty-two million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •