Base | Representation |
---|---|
bin | 11101100101010111100001… |
… | …000011111101110100111000 |
3 | 122001200111210122110101221220 |
4 | 131211113201003331310320 |
5 | 114023220234333223000 |
6 | 1140420134105032040 |
7 | 36256140220665420 |
oct | 3545274103756470 |
9 | 561614718411856 |
10 | 130111220211000 |
11 | 385039498a8986 |
12 | 12714514485620 |
13 | 577a587801a22 |
14 | 241b5b9453480 |
15 | 10097588701a0 |
hex | 7655e10fdd38 |
130111220211000 has 128 divisors (see below), whose sum is σ = 463939436712960. Its totient is φ = 29739707472000.
The previous prime is 130111220210981. The next prime is 130111220211023. The reversal of 130111220211000 is 112022111031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3097865196 + ... + 3097907195.
It is an arithmetic number, because the mean of its divisors is an integer number (3624526849320).
Almost surely, 2130111220211000 is an apocalyptic number.
130111220211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130111220211000 is an abundant number, since it is smaller than the sum of its proper divisors (333828216501960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130111220211000 is a wasteful number, since it uses less digits than its factorization.
130111220211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6195772422 (or 6195772408 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 130111220211000 its reverse (112022111031), we get a palindrome (130223242322031).
The spelling of 130111220211000 in words is "one hundred thirty trillion, one hundred eleven billion, two hundred twenty million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.043 sec. • engine limits •