Base | Representation |
---|---|
bin | 111100110101000010… |
… | …1001101010110000001 |
3 | 110111011202002000202020 |
4 | 1321222011031112001 |
5 | 4120011431103103 |
6 | 140002055512053 |
7 | 12303050134401 |
oct | 1715205152601 |
9 | 414152060666 |
10 | 130628769153 |
11 | 50443597763 |
12 | 21397388629 |
13 | c41a23409c |
14 | 6472bc0801 |
15 | 35e8165753 |
hex | 1e6a14d581 |
130628769153 has 8 divisors (see below), whose sum is σ = 179790134016. Its totient is φ = 84276625200.
The previous prime is 130628769151. The next prime is 130628769157. The reversal of 130628769153 is 351967826031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130628769153 - 21 = 130628769151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130628769096 and 130628769105.
It is not an unprimeable number, because it can be changed into a prime (130628769151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 702305118 + ... + 702305303.
It is an arithmetic number, because the mean of its divisors is an integer number (22473766752).
Almost surely, 2130628769153 is an apocalyptic number.
It is an amenable number.
130628769153 is a deficient number, since it is larger than the sum of its proper divisors (49161364863).
130628769153 is a wasteful number, since it uses less digits than its factorization.
130628769153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404610455.
The product of its (nonzero) digits is 1632960, while the sum is 51.
The spelling of 130628769153 in words is "one hundred thirty billion, six hundred twenty-eight million, seven hundred sixty-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •