Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …0100011110101010100011 |
3 | 1100010020002221121101101221 |
4 | 2110130213210132222203 |
5 | 2314114040031432321 |
6 | 33410212143235511 |
7 | 2102004344344141 |
oct | 224344744365243 |
9 | 40106087541357 |
10 | 10201211202211 |
11 | 3283344862387 |
12 | 1189090ba8b97 |
13 | 58cc7c3919a3 |
14 | 273a54018591 |
15 | 12a5548b6e41 |
hex | 9472791eaa3 |
10201211202211 has 8 divisors (see below), whose sum is σ = 10376329950000. Its totient is φ = 10027545722400.
The previous prime is 10201211202199. The next prime is 10201211202293. The reversal of 10201211202211 is 11220211210201.
10201211202211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10201211202211 - 243 = 1405118180003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201211202811) 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, 363302836 + ... + 363330913.
It is an arithmetic number, because the mean of its divisors is an integer number (1297041243750).
Almost surely, 210201211202211 is an apocalyptic number.
10201211202211 is a deficient number, since it is larger than the sum of its proper divisors (175118747789).
10201211202211 is a wasteful number, since it uses less digits than its factorization.
10201211202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726633989.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10201211202211 its reverse (11220211210201), we get a palindrome (21421422412412).
The spelling of 10201211202211 in words is "ten trillion, two hundred one billion, two hundred eleven million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •