Base | Representation |
---|---|
bin | 111100111010100101… |
… | …1100000111001001001 |
3 | 110111122201110002022011 |
4 | 1321311023200321021 |
5 | 4120402113041330 |
6 | 140032350455521 |
7 | 12310500624313 |
oct | 1716513407111 |
9 | 414581402264 |
10 | 130814971465 |
11 | 50529706272 |
12 | 214298045a1 |
13 | c44999a079 |
14 | 648d8107b3 |
15 | 360969682a |
hex | 1e752e0e49 |
130814971465 has 32 divisors (see below), whose sum is σ = 169846502400. Its totient is φ = 96424796160.
The previous prime is 130814971439. The next prime is 130814971471. The reversal of 130814971465 is 564179418031.
It is a de Polignac number, because none of the positive numbers 2k-130814971465 is a prime.
It is a super-2 number, since 2×1308149714652 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1391881 + ... + 1482889.
It is an arithmetic number, because the mean of its divisors is an integer number (5307703200).
Almost surely, 2130814971465 is an apocalyptic number.
It is an amenable number.
130814971465 is a deficient number, since it is larger than the sum of its proper divisors (39031530935).
130814971465 is a wasteful number, since it uses less digits than its factorization.
130814971465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91497.
The product of its (nonzero) digits is 725760, while the sum is 49.
The spelling of 130814971465 in words is "one hundred thirty billion, eight hundred fourteen million, nine hundred seventy-one thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •