Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1010101100111001111011 |
3 | 1100010020010122110102222122 |
4 | 2110130220022230321323 |
5 | 2314114100113101021 |
6 | 33410213142111455 |
7 | 2102004525455321 |
oct | 224345012547173 |
9 | 40106118412878 |
10 | 10201221222011 |
11 | 328334a486406 |
12 | 118909441b58b |
13 | 58cc8148c571 |
14 | 273a554a5d11 |
15 | 12a5556e5bab |
hex | 947282ace7b |
10201221222011 has 8 divisors (see below), whose sum is σ = 10356642682848. Its totient is φ = 10046125936000.
The previous prime is 10201221221963. The next prime is 10201221222029. The reversal of 10201221222011 is 11022212210201.
10201221222011 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 10201221222011 - 214 = 10201221205627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201221222911) 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, 81480680 + ... + 81605781.
It is an arithmetic number, because the mean of its divisors is an integer number (1294580335356).
Almost surely, 210201221222011 is an apocalyptic number.
10201221222011 is a deficient number, since it is larger than the sum of its proper divisors (155421460837).
10201221222011 is an equidigital number, since it uses as much as digits as its factorization.
10201221222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163087413.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10201221222011 its reverse (11022212210201), we get a palindrome (21223433432212).
The spelling of 10201221222011 in words is "ten trillion, two hundred one billion, two hundred twenty-one million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •