Base | Representation |
---|---|
bin | 111100101011100110… |
… | …1010101001100000010 |
3 | 110110100200021011022110 |
4 | 1321113031111030002 |
5 | 4113334401200310 |
6 | 135510425120150 |
7 | 12262153561143 |
oct | 1712715251402 |
9 | 413320234273 |
10 | 130312131330 |
11 | 502a088a007 |
12 | 21309329056 |
13 | c39975c324 |
14 | 6442b19aca |
15 | 35ca46bd20 |
hex | 1e57355302 |
130312131330 has 128 divisors (see below), whose sum is σ = 343355500800. Its totient is φ = 31505137664.
The previous prime is 130312131293. The next prime is 130312131349. The reversal of 130312131330 is 33131213031.
It is a junction number, because it is equal to n+sod(n) for n = 130312131297 and 130312131306.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6542026 + ... + 6561914.
It is an arithmetic number, because the mean of its divisors is an integer number (2682464850).
Almost surely, 2130312131330 is an apocalyptic number.
130312131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 130312131330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171677750400).
130312131330 is an abundant number, since it is smaller than the sum of its proper divisors (213043369470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130312131330 is a wasteful number, since it uses less digits than its factorization.
130312131330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20388.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 130312131330 its reverse (33131213031), we get a palindrome (163443344361).
The spelling of 130312131330 in words is "one hundred thirty billion, three hundred twelve million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •