Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …111111001110101110111110 |
3 | 111020121200211210210221122210 |
4 | 112331301130333032232332 |
5 | 101214304104304341110 |
6 | 554451403332121250 |
7 | 30163103663206152 |
oct | 2675613477165676 |
9 | 436550753727583 |
10 | 101002011012030 |
11 | 2a200792110187 |
12 | b3b2a49166226 |
13 | 44485aac4321b |
14 | 1ad274837d062 |
15 | ba2462871520 |
hex | 5bdc5cfcebbe |
101002011012030 has 16 divisors (see below), whose sum is σ = 242404826428944. Its totient is φ = 26933869603200.
The previous prime is 101002011011959. The next prime is 101002011012031. The reversal of 101002011012030 is 30210110200101.
It is a junction number, because it is equal to n+sod(n) for n = 101002011011997 and 101002011012015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002011012031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1683366850171 + ... + 1683366850230.
It is an arithmetic number, because the mean of its divisors is an integer number (15150301651809).
Almost surely, 2101002011012030 is an apocalyptic number.
101002011012030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101002011012030 is an abundant number, since it is smaller than the sum of its proper divisors (141402815416914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002011012030 is a wasteful number, since it uses less digits than its factorization.
101002011012030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3366733700411.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101002011012030 its reverse (30210110200101), we get a palindrome (131212121212131).
The spelling of 101002011012030 in words is "one hundred one trillion, two billion, eleven million, twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •