Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …011001000101000110011100 |
3 | 111020121200211002222211221222 |
4 | 112331301130121011012130 |
5 | 101214304044224323400 |
6 | 554451402333512512 |
7 | 30163103512204010 |
oct | 2675613431050634 |
9 | 436550732884858 |
10 | 101002001011100 |
11 | 2a2007874aa352 |
12 | b3b2a45942738 |
13 | 44485a8b51107 |
14 | 1ad2746cd8540 |
15 | ba2461a48185 |
hex | 5bdc5c64519c |
101002001011100 has 72 divisors (see below), whose sum is σ = 250486530731808. Its totient is φ = 34629040684800.
The previous prime is 101002001011097. The next prime is 101002001011103. The reversal of 101002001011100 is 1110100200101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (101002001011097) and next prime (101002001011103).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002001011103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 144757070 + ... + 145453130.
Almost surely, 2101002001011100 is an apocalyptic number.
101002001011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101002001011100 is an abundant number, since it is smaller than the sum of its proper divisors (149484529720708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002001011100 is a wasteful number, since it uses less digits than its factorization.
101002001011100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 903375 (or 903368 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 101002001011100 its reverse (1110100200101), we get a palindrome (102112101211201).
The spelling of 101002001011100 in words is "one hundred one trillion, two billion, one million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •