Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …0000010001110100010011 |
3 | 1100010020002212112102211202 |
4 | 2110130213200101310103 |
5 | 2314114034241213021 |
6 | 33410212103501415 |
7 | 2102004332106506 |
oct | 224344740216423 |
9 | 40106085472752 |
10 | 10201210101011 |
11 | 328334417aaa6 |
12 | 118909075786b |
13 | 58cc7c0976a7 |
14 | 273a53c0d13d |
15 | 12a55474aa0b |
hex | 94727811d13 |
10201210101011 has 16 divisors (see below), whose sum is σ = 11025622056960. Its totient is φ = 9410686808160.
The previous prime is 10201210100989. The next prime is 10201210101031. The reversal of 10201210101011 is 11010101210201.
It is a cyclic number.
It is not a de Polignac number, because 10201210101011 - 230 = 10200136359187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201210100983 and 10201210101001.
It is not an unprimeable number, because it can be changed into a prime (10201210101031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24206531 + ... + 24624348.
It is an arithmetic number, because the mean of its divisors is an integer number (689101378560).
Almost surely, 210201210101011 is an apocalyptic number.
10201210101011 is a deficient number, since it is larger than the sum of its proper divisors (824411955949).
10201210101011 is a wasteful number, since it uses less digits than its factorization.
10201210101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48831226.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10201210101011 its reverse (11010101210201), we get a palindrome (21211311311212).
The spelling of 10201210101011 in words is "ten trillion, two hundred one billion, two hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •