Base | Representation |
---|---|
bin | 11101101100111100110111… |
… | …001110011000000111111011 |
3 | 122010112022221112221021202011 |
4 | 131230330313032120013323 |
5 | 114110240031321323142 |
6 | 1141455402023150351 |
7 | 36341606403054145 |
oct | 3554746716300773 |
9 | 563468845837664 |
10 | 130632356823547 |
11 | 38694964937207 |
12 | 12799513ba53b7 |
13 | 57b7769956b17 |
14 | 24388d58abc95 |
15 | 10180a9dd8417 |
hex | 76cf373981fb |
130632356823547 has 2 divisors, whose sum is σ = 130632356823548. Its totient is φ = 130632356823546.
The previous prime is 130632356823539. The next prime is 130632356823611. The reversal of 130632356823547 is 745328653236031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130632356823547 - 23 = 130632356823539 is a prime.
It is a super-2 number, since 2×1306323568235472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130632356823491 and 130632356823500.
It is not a weakly prime, because it can be changed into another prime (130632356820547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65316178411773 + 65316178411774.
It is an arithmetic number, because the mean of its divisors is an integer number (65316178411774).
Almost surely, 2130632356823547 is an apocalyptic number.
130632356823547 is a deficient number, since it is larger than the sum of its proper divisors (1).
130632356823547 is an equidigital number, since it uses as much as digits as its factorization.
130632356823547 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65318400, while the sum is 58.
The spelling of 130632356823547 in words is "one hundred thirty trillion, six hundred thirty-two billion, three hundred fifty-six million, eight hundred twenty-three thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •