Base | Representation |
---|---|
bin | 111100110010110010… |
… | …0010111100010110001 |
3 | 110110222110121011101210 |
4 | 1321211210113202301 |
5 | 4114333040120223 |
6 | 135550352550333 |
7 | 12301140424566 |
oct | 1714544274261 |
9 | 413873534353 |
10 | 130553051313 |
11 | 50404880833 |
12 | 21375b523a9 |
13 | c407642b29 |
14 | 6466b1086d |
15 | 35e16aa893 |
hex | 1e659178b1 |
130553051313 has 16 divisors (see below), whose sum is σ = 185291150400. Its totient is φ = 81528099840.
The previous prime is 130553051311. The next prime is 130553051357. The reversal of 130553051313 is 313150355031.
It is not a de Polignac number, because 130553051313 - 21 = 130553051311 is a prime.
It is a super-2 number, since 2×1305530513132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130553051311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12862368 + ... + 12872513.
It is an arithmetic number, because the mean of its divisors is an integer number (11580696900).
Almost surely, 2130553051313 is an apocalyptic number.
It is an amenable number.
130553051313 is a deficient number, since it is larger than the sum of its proper divisors (54738099087).
130553051313 is a wasteful number, since it uses less digits than its factorization.
130553051313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25734992.
The product of its (nonzero) digits is 10125, while the sum is 30.
The spelling of 130553051313 in words is "one hundred thirty billion, five hundred fifty-three million, fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •