Base | Representation |
---|---|
bin | 1001001101000111101111… |
… | …0100001000000000000001 |
3 | 1022211120010022002221222212 |
4 | 2103101323310020000001 |
5 | 2311310322133224301 |
6 | 33305311004111505 |
7 | 2063135213226344 |
oct | 223217364100001 |
9 | 38746108087885 |
10 | 10121020211201 |
11 | 3252334066999 |
12 | 1175631235595 |
13 | 58553c808353 |
14 | 26dc07b6445b |
15 | 12840e76d4bb |
hex | 9347bd08001 |
10121020211201 has 4 divisors (see below), whose sum is σ = 10121092906452. Its totient is φ = 10120947515952.
The previous prime is 10121020211189. The next prime is 10121020211249. The reversal of 10121020211201 is 10211202012101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8140470628801 + 1980549582400 = 2853151^2 + 1407320^2 .
It is a cyclic number.
It is not a de Polignac number, because 10121020211201 - 210 = 10121020210177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10121020210201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36138386 + ... + 36417371.
It is an arithmetic number, because the mean of its divisors is an integer number (2530273226613).
Almost surely, 210121020211201 is an apocalyptic number.
It is an amenable number.
10121020211201 is a deficient number, since it is larger than the sum of its proper divisors (72695251).
10121020211201 is an equidigital number, since it uses as much as digits as its factorization.
10121020211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72695250.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10121020211201 its reverse (10211202012101), we get a palindrome (20332222223302).
The spelling of 10121020211201 in words is "ten trillion, one hundred twenty-one billion, twenty million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •