Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …0100111010011111111011 |
3 | 1022202120011202001110010210 |
4 | 2102332132010322133323 |
5 | 2310440021232414321 |
6 | 33251533044242203 |
7 | 2061465252122535 |
oct | 222763604723773 |
9 | 38676152043123 |
10 | 10100120201211 |
11 | 32444895a9067 |
12 | 11715799a0363 |
13 | 58358b832631 |
14 | 26cbc411c855 |
15 | 127ad99c2b76 |
hex | 92f9e13a7fb |
10100120201211 has 8 divisors (see below), whose sum is σ = 13600161855504. Its totient is φ = 6666746007200.
The previous prime is 10100120201123. The next prime is 10100120201239. The reversal of 10100120201211 is 11210202100101.
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 10100120201211 - 221 = 10100118104059 is a prime.
It is a super-3 number, since 3×101001202012113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10100120201261) 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, 16666864716 + ... + 16666865321.
It is an arithmetic number, because the mean of its divisors is an integer number (1700020231938).
Almost surely, 210100120201211 is an apocalyptic number.
10100120201211 is a deficient number, since it is larger than the sum of its proper divisors (3500041654293).
10100120201211 is a wasteful number, since it uses less digits than its factorization.
10100120201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33333730141.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10100120201211 its reverse (11210202100101), we get a palindrome (21310322301312).
The spelling of 10100120201211 in words is "ten trillion, one hundred billion, one hundred twenty million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •