Base | Representation |
---|---|
bin | 11101101010100001110110… |
… | …111100100110011000101100 |
3 | 122002221102100102210102010000 |
4 | 131222201312330212120230 |
5 | 114100023202034240102 |
6 | 1141251114531144300 |
7 | 36323565113664132 |
oct | 3552416674463054 |
9 | 562842312712100 |
10 | 130465922180652 |
11 | 38630317916663 |
12 | 12771205445090 |
13 | 57a4b645707c6 |
14 | 2430827567752 |
15 | 1013ab85aa01c |
hex | 76a876f2662c |
130465922180652 has 60 divisors (see below), whose sum is σ = 341067189327480. Its totient is φ = 43488194739264.
The previous prime is 130465922180647. The next prime is 130465922180677. The reversal of 130465922180652 is 256081229564031.
130465922180652 is a `hidden beast` number, since 1 + 3 + 0 + 46 + 592 + 2 + 1 + 8 + 0 + 6 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 30362203 + ... + 34391789.
It is an arithmetic number, because the mean of its divisors is an integer number (5684453155458).
Almost surely, 2130465922180652 is an apocalyptic number.
130465922180652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130465922180652 is an abundant number, since it is smaller than the sum of its proper divisors (210601267146828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130465922180652 is a wasteful number, since it uses less digits than its factorization.
130465922180652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4129532 (or 4129521 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 54.
The spelling of 130465922180652 in words is "one hundred thirty trillion, four hundred sixty-five billion, nine hundred twenty-two million, one hundred eighty thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •