Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000100001111110001001100 |
3 | 111020122122220210000000200220 |
4 | 112331322313010033301030 |
5 | 101214440301211223040 |
6 | 554500153531551340 |
7 | 30163612210035663 |
oct | 2675726704176114 |
9 | 436578823000626 |
10 | 101012112211020 |
11 | 2a204aa5a6551a |
12 | b3b49a7bbb550 |
13 | 444952a8a3b4a |
14 | 1ad3025b25dda |
15 | ba285456e2d0 |
hex | 5bdeb710fc4c |
101012112211020 has 24 divisors (see below), whose sum is σ = 282833914191024. Its totient is φ = 26936563256256.
The previous prime is 101012112210991. The next prime is 101012112211033. The reversal of 101012112211020 is 20112211210101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 841767601699 + ... + 841767601818.
It is an arithmetic number, because the mean of its divisors is an integer number (11784746424626).
Almost surely, 2101012112211020 is an apocalyptic number.
101012112211020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012112211020 is an abundant number, since it is smaller than the sum of its proper divisors (181821801980004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012112211020 is a wasteful number, since it uses less digits than its factorization.
101012112211020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683535203529 (or 1683535203527 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101012112211020 its reverse (20112211210101), we get a palindrome (121124323421121).
The spelling of 101012112211020 in words is "one hundred one trillion, twelve billion, one hundred twelve million, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •