Base | Representation |
---|---|
bin | 11101100011111011001101… |
… | …001010110011000111010000 |
3 | 122001100000221221110020212211 |
4 | 131203323031022303013100 |
5 | 114020104241131210000 |
6 | 1140302422450201504 |
7 | 36246031043613523 |
oct | 3543731512630720 |
9 | 561300857406784 |
10 | 130012102210000 |
11 | 3847590631a77a |
12 | 126b9271b83294 |
13 | 577111c9553aa |
14 | 24168955c4bba |
15 | 1006da6ca87ba |
hex | 763ecd2b31d0 |
130012102210000 has 100 divisors (see below), whose sum is σ = 318564740051712. Its totient is φ = 51378276208000.
The previous prime is 130012102209943. The next prime is 130012102210019. The reversal of 130012102210000 is 12201210031.
130012102210000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (100).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 77490544 + ... + 79150543.
Almost surely, 2130012102210000 is an apocalyptic number.
130012102210000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130012102210000 is an abundant number, since it is smaller than the sum of its proper divisors (188552637841712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130012102210000 is an equidigital number, since it uses as much as digits as its factorization.
130012102210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156641198 (or 156641177 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 130012102210000 its reverse (12201210031), we get a palindrome (130024303420031).
The spelling of 130012102210000 in words is "one hundred thirty trillion, twelve billion, one hundred two million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •