Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …100100100001110010001001 |
3 | 111020122122200100111201211210 |
4 | 112331322301210201302021 |
5 | 101214440104110310441 |
6 | 554500140435443333 |
7 | 30163610010245463 |
oct | 2675726144416211 |
9 | 436578610451753 |
10 | 101012020010121 |
11 | 2a204a58a10630 |
12 | b3b4981156549 |
13 | 44495147611bc |
14 | 1ad30177a5133 |
15 | ba284b40a616 |
hex | 5bdeb1921c89 |
101012020010121 has 64 divisors (see below), whose sum is σ = 151782580224000. Its totient is φ = 59199122030400.
The previous prime is 101012020010087. The next prime is 101012020010141. The reversal of 101012020010121 is 121010020210101.
It is not a de Polignac number, because 101012020010121 - 227 = 101011885792393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101012020010097 and 101012020010106.
It is not an unprimeable number, because it can be changed into a prime (101012020010141) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11366263140 + ... + 11366272026.
It is an arithmetic number, because the mean of its divisors is an integer number (2371602816000).
Almost surely, 2101012020010121 is an apocalyptic number.
101012020010121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101012020010121 is a deficient number, since it is larger than the sum of its proper divisors (50770560213879).
101012020010121 is a wasteful number, since it uses less digits than its factorization.
101012020010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16210.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101012020010121 its reverse (121010020210101), we get a palindrome (222022040220222).
The spelling of 101012020010121 in words is "one hundred one trillion, twelve billion, twenty million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •