Base | Representation |
---|---|
bin | 11101100111001000000111… |
… | …010000000100101000111010 |
3 | 122002010001212100202012012210 |
4 | 131213020013100010220322 |
5 | 114032210340210100010 |
6 | 1140551450543115550 |
7 | 36300650224162455 |
oct | 3547100720045072 |
9 | 562101770665183 |
10 | 130232120003130 |
11 | 3855014a663162 |
12 | 12733a355a2bb6 |
13 | 5788ab423bc72 |
14 | 24233a80a049c |
15 | 100c982810b20 |
hex | 767207404a3a |
130232120003130 has 64 divisors (see below), whose sum is σ = 316980009739008. Its totient is φ = 34239852226560.
The previous prime is 130232120003059. The next prime is 130232120003131. The reversal of 130232120003130 is 31300021232031.
It is a junction number, because it is equal to n+sod(n) for n = 130232120003097 and 130232120003106.
It is not an unprimeable number, because it can be changed into a prime (130232120003131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84317001 + ... + 85847660.
It is an arithmetic number, because the mean of its divisors is an integer number (4952812652172).
Almost surely, 2130232120003130 is an apocalyptic number.
130232120003130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130232120003130 is an abundant number, since it is smaller than the sum of its proper divisors (186747889735878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130232120003130 is a wasteful number, since it uses less digits than its factorization.
130232120003130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170165031.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 130232120003130 its reverse (31300021232031), we get a palindrome (161532141235161).
The spelling of 130232120003130 in words is "one hundred thirty trillion, two hundred thirty-two billion, one hundred twenty million, three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •