Base | Representation |
---|---|
bin | 101010000101100001111… |
… | …111101011001001010001 |
3 | 101020111011101202220111212 |
4 | 222011201333223021101 |
5 | 334341114202300303 |
6 | 10052345535145505 |
7 | 415644230331122 |
oct | 52054177531121 |
9 | 11214141686455 |
10 | 2892157071953 |
11 | a156142a5766 |
12 | 3a8629675295 |
13 | 17c9631b4146 |
14 | 9dda43b8049 |
15 | 50371bd8ad8 |
hex | 2a161feb251 |
2892157071953 has 2 divisors, whose sum is σ = 2892157071954. Its totient is φ = 2892157071952.
The previous prime is 2892157071847. The next prime is 2892157071961. The reversal of 2892157071953 is 3591707512982.
2892157071953 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., 2709355504144 + 182801567809 = 1646012^2 + 427553^2 .
It is a cyclic number.
It is not a de Polignac number, because 2892157071953 - 214 = 2892157055569 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2892157071892 and 2892157071901.
It is not a weakly prime, because it can be changed into another prime (2892157071983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1446078535976 + 1446078535977.
It is an arithmetic number, because the mean of its divisors is an integer number (1446078535977).
Almost surely, 22892157071953 is an apocalyptic number.
It is an amenable number.
2892157071953 is a deficient number, since it is larger than the sum of its proper divisors (1).
2892157071953 is an equidigital number, since it uses as much as digits as its factorization.
2892157071953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9525600, while the sum is 59.
The spelling of 2892157071953 in words is "two trillion, eight hundred ninety-two billion, one hundred fifty-seven million, seventy-one thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •