Base | Representation |
---|---|
bin | 10110000110111100101000… |
… | …111101010101111101110001 |
3 | 110202021112010010102212122212 |
4 | 112012330220331111331301 |
5 | 100221042124124033122 |
6 | 542444520202341505 |
7 | 26323646234152565 |
oct | 2606745075257561 |
9 | 422245103385585 |
10 | 97234451783537 |
11 | 28a88999153582 |
12 | aaa48311ba895 |
13 | 42342283c1453 |
14 | 1a0225b79d6a5 |
15 | b39457d90ce2 |
hex | 586f28f55f71 |
97234451783537 has 2 divisors, whose sum is σ = 97234451783538. Its totient is φ = 97234451783536.
The previous prime is 97234451783533. The next prime is 97234451783563. The reversal of 97234451783537 is 73538715443279.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56083458454321 + 41150993329216 = 7488889^2 + 6414904^2 .
It is a cyclic number.
It is not a de Polignac number, because 97234451783537 - 22 = 97234451783533 is a prime.
It is a super-3 number, since 3×972344517835373 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (97234451783533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48617225891768 + 48617225891769.
It is an arithmetic number, because the mean of its divisors is an integer number (48617225891769).
Almost surely, 297234451783537 is an apocalyptic number.
It is an amenable number.
97234451783537 is a deficient number, since it is larger than the sum of its proper divisors (1).
97234451783537 is an equidigital number, since it uses as much as digits as its factorization.
97234451783537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 533433600, while the sum is 68.
The spelling of 97234451783537 in words is "ninety-seven trillion, two hundred thirty-four billion, four hundred fifty-one million, seven hundred eighty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •