Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …100100100100001100101011 |
3 | 111020122122200100112020102002 |
4 | 112331322301210210030223 |
5 | 101214440104111120021 |
6 | 554500140440001215 |
7 | 30163610010316352 |
oct | 2675726144441453 |
9 | 436578610466362 |
10 | 101012020020011 |
11 | 2a204a58a18001 |
12 | b3b498116020b |
13 | 4449514765859 |
14 | 1ad30177a8999 |
15 | ba284b40d50b |
hex | 5bdeb192432b |
101012020020011 has 4 divisors (see below), whose sum is σ = 101044784220312. Its totient is φ = 100979255819712.
The previous prime is 101012020019959. The next prime is 101012020020029. The reversal of 101012020020011 is 110020020210101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101012020020011 - 214 = 101012020003627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101012020019974 and 101012020020001.
It is not an unprimeable number, because it can be changed into a prime (101012020020811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16382095526 + ... + 16382101691.
It is an arithmetic number, because the mean of its divisors is an integer number (25261196055078).
Almost surely, 2101012020020011 is an apocalyptic number.
101012020020011 is a deficient number, since it is larger than the sum of its proper divisors (32764200301).
101012020020011 is an equidigital number, since it uses as much as digits as its factorization.
101012020020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32764200300.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101012020020011 its reverse (110020020210101), we get a palindrome (211032040230112).
The spelling of 101012020020011 in words is "one hundred one trillion, twelve billion, twenty million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •