Base | Representation |
---|---|
bin | 101001110011100011110… |
… | …011001011000000001101 |
3 | 101011122100112220220000111 |
4 | 221303203303023000031 |
5 | 334032104124334143 |
6 | 10035435040000021 |
7 | 414362102025016 |
oct | 51634363130015 |
9 | 11148315826014 |
10 | 2872859996173 |
11 | a08411633052 |
12 | 3a4943000011 |
13 | 17aba93308cb |
14 | 9d0935cc00d |
15 | 4eae2a1b99d |
hex | 29ce3ccb00d |
2872859996173 has 2 divisors, whose sum is σ = 2872859996174. Its totient is φ = 2872859996172.
The previous prime is 2872859996107. The next prime is 2872859996191. The reversal of 2872859996173 is 3716999582782.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2852173790244 + 20686205929 = 1688838^2 + 143827^2 .
It is a cyclic number.
It is not a de Polignac number, because 2872859996173 - 217 = 2872859865101 is a prime.
It is a super-2 number, since 2×28728599961732 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2872859996173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2872859996873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1436429998086 + 1436429998087.
It is an arithmetic number, because the mean of its divisors is an integer number (1436429998087).
Almost surely, 22872859996173 is an apocalyptic number.
It is an amenable number.
2872859996173 is a deficient number, since it is larger than the sum of its proper divisors (1).
2872859996173 is an equidigital number, since it uses as much as digits as its factorization.
2872859996173 is an evil number, because the sum of its binary digits is even.
The product of its digits is 823011840, while the sum is 76.
The spelling of 2872859996173 in words is "two trillion, eight hundred seventy-two billion, eight hundred fifty-nine million, nine hundred ninety-six thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •