Base | Representation |
---|---|
bin | 111100101010111111… |
… | …0001000011100100001 |
3 | 110110022020012100210110 |
4 | 1321111332020130201 |
5 | 4113314042313021 |
6 | 135504404121533 |
7 | 12261512240610 |
oct | 1712576103441 |
9 | 413266170713 |
10 | 130291369761 |
11 | 50290099593 |
12 | 213023962a9 |
13 | c395370387 |
14 | 6440073877 |
15 | 35c871a476 |
hex | 1e55f88721 |
130291369761 has 16 divisors (see below), whose sum is σ = 198815385600. Its totient is φ = 74348653008.
The previous prime is 130291369753. The next prime is 130291369787. The reversal of 130291369761 is 167963192031.
It is not a de Polignac number, because 130291369761 - 23 = 130291369753 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130291369761.
It is not an unprimeable number, because it can be changed into a prime (130291369711) 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, 4299471 + ... + 4329668.
It is an arithmetic number, because the mean of its divisors is an integer number (12425961600).
Almost surely, 2130291369761 is an apocalyptic number.
It is an amenable number.
130291369761 is a deficient number, since it is larger than the sum of its proper divisors (68524015839).
130291369761 is an equidigital number, since it uses as much as digits as its factorization.
130291369761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8629868.
The product of its (nonzero) digits is 367416, while the sum is 48.
The spelling of 130291369761 in words is "one hundred thirty billion, two hundred ninety-one million, three hundred sixty-nine thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •