Base | Representation |
---|---|
bin | 11101100111111111001110… |
… | …000101100111000110110001 |
3 | 122002022201121001110221201101 |
4 | 131213333032011213012301 |
5 | 114034143030332022203 |
6 | 1141034554220204401 |
7 | 36305143432132306 |
oct | 3547771605470661 |
9 | 562281531427641 |
10 | 130291290501553 |
11 | 3857325388a425 |
12 | 127433a9699701 |
13 | 5791553b870cc |
14 | 24261bc7090ad |
15 | 100e29731041d |
hex | 767fce1671b1 |
130291290501553 has 4 divisors (see below), whose sum is σ = 137148726843760. Its totient is φ = 123433854159348.
The previous prime is 130291290501551. The next prime is 130291290501571. The reversal of 130291290501553 is 355105092192031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130291290501553 - 21 = 130291290501551 is a prime.
It is a Leyland number of the form 1312 + 1213.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130291290501551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3428718171075 + ... + 3428718171112.
It is an arithmetic number, because the mean of its divisors is an integer number (34287181710940).
Almost surely, 2130291290501553 is an apocalyptic number.
It is an amenable number.
130291290501553 is a deficient number, since it is larger than the sum of its proper divisors (6857436342207).
130291290501553 is an equidigital number, since it uses as much as digits as its factorization.
130291290501553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6857436342206.
The product of its (nonzero) digits is 364500, while the sum is 46.
The spelling of 130291290501553 in words is "one hundred thirty trillion, two hundred ninety-one billion, two hundred ninety million, five hundred one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •