Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …101010011001011100010000 |
3 | 111020122122221110211010121201 |
4 | 112331322313222121130100 |
5 | 101214440311241241422 |
6 | 554500154530200544 |
7 | 30163612361041456 |
oct | 2675726752313420 |
9 | 436578843733551 |
10 | 101012122212112 |
11 | 2a205000676491 |
12 | b3b49ab423154 |
13 | 444952c996057 |
14 | 1ad30271aa9d6 |
15 | ba2855397727 |
hex | 5bdeb7a99710 |
101012122212112 has 40 divisors (see below), whose sum is σ = 206012811161600. Its totient is φ = 47847557941632.
The previous prime is 101012122212101. The next prime is 101012122212149. The reversal of 101012122212112 is 211212221210101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 101012122212112.
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, 54340678 + ... + 56168794.
It is an arithmetic number, because the mean of its divisors is an integer number (5150320279040).
Almost surely, 2101012122212112 is an apocalyptic number.
It is an amenable number.
101012122212112 is an abundant number, since it is smaller than the sum of its proper divisors (105000688949488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012122212112 is a wasteful number, since it uses less digits than its factorization.
101012122212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2009903 (or 2009897 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 101012122212112 its reverse (211212221210101), we get a palindrome (312224343422213).
The spelling of 101012122212112 in words is "one hundred one trillion, twelve billion, one hundred twenty-two million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.569 sec. • engine limits •