Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110100001111001010110 |
3 | 111020121121020100102021101220 |
4 | 112331300200232201321112 |
5 | 101214300022000013420 |
6 | 554451115134431210 |
7 | 30163036635565356 |
oct | 2675604056417126 |
9 | 436547210367356 |
10 | 101001000001110 |
11 | 2a200313456770 |
12 | b3b2806662506 |
13 | 444847964c301 |
14 | 1ad268dda6b66 |
15 | ba2403c17840 |
hex | 5bdc20ba1e56 |
101001000001110 has 32 divisors (see below), whose sum is σ = 264438981821952. Its totient is φ = 24485090909280.
The previous prime is 101001000001093. The next prime is 101001000001127. The reversal of 101001000001110 is 11100000100101.
It is an interprime number because it is at equal distance from previous prime (101001000001093) and next prime (101001000001127).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153031817854 + ... + 153031818513.
It is an arithmetic number, because the mean of its divisors is an integer number (8263718181936).
Almost surely, 2101001000001110 is an apocalyptic number.
101001000001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101001000001110 is an abundant number, since it is smaller than the sum of its proper divisors (163437981820842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001000001110 is a wasteful number, since it uses less digits than its factorization.
101001000001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306063636388.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101001000001110 its reverse (11100000100101), we get a palindrome (112101000101211).
The spelling of 101001000001110 in words is "one hundred one trillion, one billion, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •