Base | Representation |
---|---|
bin | 111100101111010011… |
… | …1000110100011100011 |
3 | 110110200022221222122012 |
4 | 1321132213012203203 |
5 | 4114113144441101 |
6 | 135531023103135 |
7 | 12265222330430 |
oct | 1713647064343 |
9 | 413608858565 |
10 | 130436327651 |
11 | 503549a75a3 |
12 | 21342a41aab |
13 | c3b93c5286 |
14 | 6455408b87 |
15 | 35d6300bbb |
hex | 1e5e9c68e3 |
130436327651 has 8 divisors (see below), whose sum is σ = 149485328640. Its totient is φ = 111491136648.
The previous prime is 130436327603. The next prime is 130436327653. The reversal of 130436327651 is 156723634031.
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 130436327651 - 210 = 130436326627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130436327599 and 130436327608.
It is not an unprimeable number, because it can be changed into a prime (130436327653) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25949801 + ... + 25954826.
It is an arithmetic number, because the mean of its divisors is an integer number (18685666080).
Almost surely, 2130436327651 is an apocalyptic number.
130436327651 is a deficient number, since it is larger than the sum of its proper divisors (19049000989).
130436327651 is an equidigital number, since it uses as much as digits as its factorization.
130436327651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51904993.
The product of its (nonzero) digits is 272160, while the sum is 41.
The spelling of 130436327651 in words is "one hundred thirty billion, four hundred thirty-six million, three hundred twenty-seven thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •