Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000011111001100011001011 |
3 | 111020122122220202211101212012 |
4 | 112331322313003321203023 |
5 | 101214440301200320021 |
6 | 554500153530010135 |
7 | 30163612206206441 |
oct | 2675726703714313 |
9 | 436578822741765 |
10 | 101012112120011 |
11 | 2a204aa5a03104 |
12 | b3b49a7b7694b |
13 | 444952a8715b1 |
14 | 1ad3025b00b91 |
15 | ba285455235b |
hex | 5bdeb70f98cb |
101012112120011 has 8 divisors (see below), whose sum is σ = 101194951659984. Its totient is φ = 100829284715680.
The previous prime is 101012112119993. The next prime is 101012112120013. The reversal of 101012112120011 is 110021211210101.
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 101012112120011 - 234 = 100994932250827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101012112120013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13711901 + ... + 19749441.
It is an arithmetic number, because the mean of its divisors is an integer number (12649368957498).
Almost surely, 2101012112120011 is an apocalyptic number.
101012112120011 is a deficient number, since it is larger than the sum of its proper divisors (182839539973).
101012112120011 is an equidigital number, since it uses as much as digits as its factorization.
101012112120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6067821.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101012112120011 its reverse (110021211210101), we get a palindrome (211033323330112).
The spelling of 101012112120011 in words is "one hundred one trillion, twelve billion, one hundred twelve million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •