Base | Representation |
---|---|
bin | 10010011011111010110011… |
… | …000110100011111001011101 |
3 | 101122002111102101022010211102 |
4 | 102123322303012203321131 |
5 | 41111432244222033303 |
6 | 444241110520002445 |
7 | 23036040114420041 |
oct | 2233726306437135 |
9 | 348074371263742 |
10 | 81083397455453 |
11 | 23921304029738 |
12 | 9116609900425 |
13 | 36321930a7423 |
14 | 1604659080021 |
15 | 959272a72288 |
hex | 49beb31a3e5d |
81083397455453 has 2 divisors, whose sum is σ = 81083397455454. Its totient is φ = 81083397455452.
The previous prime is 81083397455383. The next prime is 81083397455507. The reversal of 81083397455453 is 35455479338018.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80453401254724 + 629996200729 = 8969582^2 + 793723^2 .
It is a cyclic number.
It is not a de Polignac number, because 81083397455453 - 210 = 81083397454429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 81083397455453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (81083397455953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40541698727726 + 40541698727727.
It is an arithmetic number, because the mean of its divisors is an integer number (40541698727727).
Almost surely, 281083397455453 is an apocalyptic number.
It is an amenable number.
81083397455453 is a deficient number, since it is larger than the sum of its proper divisors (1).
81083397455453 is an equidigital number, since it uses as much as digits as its factorization.
81083397455453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728000, while the sum is 65.
The spelling of 81083397455453 in words is "eighty-one trillion, eighty-three billion, three hundred ninety-seven million, four hundred fifty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •