Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000011011110111101100110 |
3 | 111020122122220202121212110211 |
4 | 112331322313003132331212 |
5 | 101214440301133323420 |
6 | 554500153523410034 |
7 | 30163612205244106 |
oct | 2675726703367546 |
9 | 436578822555424 |
10 | 101012112011110 |
11 | 2a204aa5939303 |
12 | b3b49a7b2391a |
13 | 444952a833b61 |
14 | 1ad3025ab3206 |
15 | ba285452ee5a |
hex | 5bdeb70def66 |
101012112011110 has 64 divisors (see below), whose sum is σ = 196226597952000. Its totient is φ = 37295932291072.
The previous prime is 101012112011101. The next prime is 101012112011137. The reversal of 101012112011110 is 11110211210101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20767371 + ... + 25165609.
It is an arithmetic number, because the mean of its divisors is an integer number (3066040593000).
Almost surely, 2101012112011110 is an apocalyptic number.
101012112011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101012112011110 is a deficient number, since it is larger than the sum of its proper divisors (95214485940890).
101012112011110 is a wasteful number, since it uses less digits than its factorization.
101012112011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4400865.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101012112011110 its reverse (11110211210101), we get a palindrome (112122323221211).
The spelling of 101012112011110 in words is "one hundred one trillion, twelve billion, one hundred twelve million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •