Base | Representation |
---|---|
bin | 1110100110100111101011… |
… | …10110111000100001110010 |
3 | 11012201000001010001201012210 |
4 | 13103103311312320201302 |
5 | 13202121014334411010 |
6 | 152144351351032550 |
7 | 6523052342551164 |
oct | 723236566704162 |
9 | 135630033051183 |
10 | 32113300310130 |
11 | a2611a0918886 |
12 | 372793336b756 |
13 | 14bc36ab60a40 |
14 | 7d041347a934 |
15 | 3aa5199b3b20 |
hex | 1d34f5db8872 |
32113300310130 has 64 divisors (see below), whose sum is σ = 85677966517248. Its totient is φ = 7649818433280.
The previous prime is 32113300310023. The next prime is 32113300310213. The reversal of 32113300310130 is 3101300331123.
It is a junction number, because it is equal to n+sod(n) for n = 32113300310097 and 32113300310106.
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, 1328081389 + ... + 1328105568.
It is an arithmetic number, because the mean of its divisors is an integer number (1338718226832).
Almost surely, 232113300310130 is an apocalyptic number.
32113300310130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32113300310130 is an abundant number, since it is smaller than the sum of its proper divisors (53564666207118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32113300310130 is a wasteful number, since it uses less digits than its factorization.
32113300310130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2656187011.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 32113300310130 its reverse (3101300331123), we get a palindrome (35214600641253).
The spelling of 32113300310130 in words is "thirty-two trillion, one hundred thirteen billion, three hundred million, three hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •