Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …111111001100000100011000 |
3 | 111020121200211210210101200102 |
4 | 112331301130333030010120 |
5 | 101214304104304013422 |
6 | 554451403331554532 |
7 | 30163103663132264 |
oct | 2675613477140430 |
9 | 436550753711612 |
10 | 101002011001112 |
11 | 2a200792102a61 |
12 | b3b2a4915ba48 |
13 | 44485aac3b270 |
14 | 1ad27483790a4 |
15 | ba246286d192 |
hex | 5bdc5cfcc118 |
101002011001112 has 96 divisors (see below), whose sum is σ = 215264251868400. Its totient is φ = 44158941635328.
The previous prime is 101002011001081. The next prime is 101002011001159. The reversal of 101002011001112 is 211100110200101.
It is a junction number, because it is equal to n+sod(n) for n = 101002011001093 and 101002011001102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 449927714 + ... + 450152142.
Almost surely, 2101002011001112 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 101002011001112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107632125934200).
101002011001112 is an abundant number, since it is smaller than the sum of its proper divisors (114262240867288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002011001112 is a wasteful number, since it uses less digits than its factorization.
101002011001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236473 (or 236450 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101002011001112 its reverse (211100110200101), we get a palindrome (312102121201213).
The spelling of 101002011001112 in words is "one hundred one trillion, two billion, eleven million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •