Base | Representation |
---|---|
bin | 10010101000100011110010… |
… | …101001000001011111010111 |
3 | 101202011112120001101100111212 |
4 | 102220203302221001133113 |
5 | 41220200242443113314 |
6 | 450144130043052035 |
7 | 23155561055423411 |
oct | 2250436251013727 |
9 | 352145501340455 |
10 | 81952046847959 |
11 | 24126738a62062 |
12 | 9236a3281101b |
13 | 36960777246c2 |
14 | 16347008c59b1 |
15 | 971b62ad9e3e |
hex | 4a88f2a417d7 |
81952046847959 has 2 divisors, whose sum is σ = 81952046847960. Its totient is φ = 81952046847958.
The previous prime is 81952046847953. The next prime is 81952046848003. The reversal of 81952046847959 is 95974864025918.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 81952046847959 - 232 = 81947751880663 is a prime.
It is a super-2 number, since 2×819520468479592 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 81952046847959.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (81952046847953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40976023423979 + 40976023423980.
It is an arithmetic number, because the mean of its divisors is an integer number (40976023423980).
Almost surely, 281952046847959 is an apocalyptic number.
81952046847959 is a deficient number, since it is larger than the sum of its proper divisors (1).
81952046847959 is an equidigital number, since it uses as much as digits as its factorization.
81952046847959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1567641600, while the sum is 77.
The spelling of 81952046847959 in words is "eighty-one trillion, nine hundred fifty-two billion, forty-six million, eight hundred forty-seven thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •