Base | Representation |
---|---|
bin | 101001110101001100110… |
… | …011011011110111111001 |
3 | 101011210220022211100020122 |
4 | 221311030303123313321 |
5 | 334044211122013303 |
6 | 10040325530503025 |
7 | 414453543026642 |
oct | 51651463336771 |
9 | 11153808740218 |
10 | 2874621672953 |
11 | a09135aa1978 |
12 | 3a5154b94a75 |
13 | 17b0ca2c33c4 |
14 | 9d1bd56a6c9 |
15 | 4eb97504e38 |
hex | 29d4ccdbdf9 |
2874621672953 has 2 divisors, whose sum is σ = 2874621672954. Its totient is φ = 2874621672952.
The previous prime is 2874621672947. The next prime is 2874621673031. The reversal of 2874621672953 is 3592761264782.
2874621672953 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2795276360464 + 79345312489 = 1671908^2 + 281683^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2874621672953 is a prime.
It is a super-2 number, since 2×28746216729532 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2874621672353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1437310836476 + 1437310836477.
It is an arithmetic number, because the mean of its divisors is an integer number (1437310836477).
Almost surely, 22874621672953 is an apocalyptic number.
It is an amenable number.
2874621672953 is a deficient number, since it is larger than the sum of its proper divisors (1).
2874621672953 is an equidigital number, since it uses as much as digits as its factorization.
2874621672953 is an evil number, because the sum of its binary digits is even.
The product of its digits is 60963840, while the sum is 62.
The spelling of 2874621672953 in words is "two trillion, eight hundred seventy-four billion, six hundred twenty-one million, six hundred seventy-two thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •