Base | Representation |
---|---|
bin | 10010010100110011001010… |
… | …11100111100010100001101 |
3 | 12021200100211011020202022011 |
4 | 21022121211130330110031 |
5 | 20240211412311210343 |
6 | 221412120404221221 |
7 | 11326240224053116 |
oct | 1112314534742415 |
9 | 167610734222264 |
10 | 40297085256973 |
11 | 119269970a2836 |
12 | 4629a1839a811 |
13 | 1963cca592c4c |
14 | 9d456448920d |
15 | 49d34657829d |
hex | 24a66573c50d |
40297085256973 has 2 divisors, whose sum is σ = 40297085256974. Its totient is φ = 40297085256972.
The previous prime is 40297085256971. The next prime is 40297085256977. The reversal of 40297085256973 is 37965258079204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30348441959364 + 9948643297609 = 5508942^2 + 3154147^2 .
It is a cyclic number.
It is not a de Polignac number, because 40297085256973 - 21 = 40297085256971 is a prime.
Together with 40297085256971, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 40297085256899 and 40297085256908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40297085256971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20148542628486 + 20148542628487.
It is an arithmetic number, because the mean of its divisors is an integer number (20148542628487).
Almost surely, 240297085256973 is an apocalyptic number.
It is an amenable number.
40297085256973 is a deficient number, since it is larger than the sum of its proper divisors (1).
40297085256973 is an equidigital number, since it uses as much as digits as its factorization.
40297085256973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 228614400, while the sum is 67.
The spelling of 40297085256973 in words is "forty trillion, two hundred ninety-seven billion, eighty-five million, two hundred fifty-six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •