Base | Representation |
---|---|
bin | 10110111101111010110110… |
… | …111111101000101000000000 |
3 | 111020122122220200201121101112 |
4 | 112331322312333220220000 |
5 | 101214440300404031422 |
6 | 554500153450022452 |
7 | 30163612163542322 |
oct | 2675726677505000 |
9 | 436578820647345 |
10 | 101012111002112 |
11 | 2a204aa530a222 |
12 | b3b49a7717a28 |
13 | 444952a56c80b |
14 | 1ad30258cd612 |
15 | ba28543d0ee2 |
hex | 5bdeb6fe8a00 |
101012111002112 has 160 divisors (see below), whose sum is σ = 214833471652800. Its totient is φ = 47312142336000.
The previous prime is 101012111002097. The next prime is 101012111002139. The reversal of 101012111002112 is 211200111210101.
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, 755497187 + ... + 755630877.
It is an arithmetic number, because the mean of its divisors is an integer number (1342709197830).
Almost surely, 2101012111002112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101012111002112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107416735826400).
101012111002112 is an abundant number, since it is smaller than the sum of its proper divisors (113821360650688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012111002112 is a wasteful number, since it uses less digits than its factorization.
101012111002112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134598 (or 134582 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101012111002112 its reverse (211200111210101), we get a palindrome (312212222212213).
The spelling of 101012111002112 in words is "one hundred one trillion, twelve billion, one hundred eleven million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •