Base | Representation |
---|---|
bin | 101011010000000111011… |
… | …011110100111010010001 |
3 | 101112010212122220001111011 |
4 | 223100013123310322101 |
5 | 342144122434311303 |
6 | 10153232411250521 |
7 | 424510634014333 |
oct | 53200733647221 |
9 | 11463778801434 |
10 | 2972242103953 |
11 | a465801aa621 |
12 | 400059a49a41 |
13 | 187386b1b845 |
14 | a3c00569453 |
15 | 524ac8a216d |
hex | 2b4076f4e91 |
2972242103953 has 2 divisors, whose sum is σ = 2972242103954. Its totient is φ = 2972242103952.
The previous prime is 2972242103881. The next prime is 2972242103983. The reversal of 2972242103953 is 3593012422792.
2972242103953 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2817523388304 + 154718715649 = 1678548^2 + 393343^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2972242103953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2972242103897 and 2972242103906.
It is not a weakly prime, because it can be changed into another prime (2972242103983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1486121051976 + 1486121051977.
It is an arithmetic number, because the mean of its divisors is an integer number (1486121051977).
Almost surely, 22972242103953 is an apocalyptic number.
It is an amenable number.
2972242103953 is a deficient number, since it is larger than the sum of its proper divisors (1).
2972242103953 is an equidigital number, since it uses as much as digits as its factorization.
2972242103953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 2972242103953 in words is "two trillion, nine hundred seventy-two billion, two hundred forty-two million, one hundred three thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •