Base | Representation |
---|---|
bin | 111100100101000010… |
… | …0001000010100001001 |
3 | 110102210022022210110101 |
4 | 1321022010020110021 |
5 | 4112411423143442 |
6 | 135432510445401 |
7 | 12253535325634 |
oct | 1711204102411 |
9 | 412708283411 |
10 | 130091615497 |
11 | 50198364218 |
12 | 21267503861 |
13 | c362b70b9c |
14 | 6421716c1b |
15 | 35b5e0dcb7 |
hex | 1e4a108509 |
130091615497 has 8 divisors (see below), whose sum is σ = 131395078080. Its totient is φ = 128788455600.
The previous prime is 130091615441. The next prime is 130091615513. The reversal of 130091615497 is 794516190031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130091615497 - 27 = 130091615369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130091615597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 843868 + ... + 986050.
It is an arithmetic number, because the mean of its divisors is an integer number (16424384760).
Almost surely, 2130091615497 is an apocalyptic number.
It is an amenable number.
130091615497 is a deficient number, since it is larger than the sum of its proper divisors (1303462583).
130091615497 is a wasteful number, since it uses less digits than its factorization.
130091615497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151343.
The product of its (nonzero) digits is 204120, while the sum is 46.
The spelling of 130091615497 in words is "one hundred thirty billion, ninety-one million, six hundred fifteen thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •