Base | Representation |
---|---|
bin | 111100111010010111… |
… | …0110100011111010101 |
3 | 110111122012021221011222 |
4 | 1321310232310133111 |
5 | 4120343201341212 |
6 | 140031521340125 |
7 | 12310346655461 |
oct | 1716456643725 |
9 | 414565257158 |
10 | 130807449557 |
11 | 50525438a14 |
12 | 21427197645 |
13 | c448265435 |
14 | 648c8134a1 |
15 | 3608bacc72 |
hex | 1e74bb47d5 |
130807449557 has 8 divisors (see below), whose sum is σ = 135094656000. Its totient is φ = 126524468880.
The previous prime is 130807449541. The next prime is 130807449599. The reversal of 130807449557 is 755944708031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130807449557 - 24 = 130807449541 is a prime.
It is a super-2 number, since 2×1308074495572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130807449499 and 130807449508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130807449757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 993458 + ... + 1117395.
It is an arithmetic number, because the mean of its divisors is an integer number (16886832000).
Almost surely, 2130807449557 is an apocalyptic number.
It is an amenable number.
130807449557 is a deficient number, since it is larger than the sum of its proper divisors (4287206443).
130807449557 is a wasteful number, since it uses less digits than its factorization.
130807449557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2112883.
The product of its (nonzero) digits is 4233600, while the sum is 53.
The spelling of 130807449557 in words is "one hundred thirty billion, eight hundred seven million, four hundred forty-nine thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •