Base | Representation |
---|---|
bin | 100101001001111111100… |
… | …101000110000100010111 |
3 | 100001002122102101101201222 |
4 | 211021333211012010113 |
5 | 313313230324120224 |
6 | 5232554313240555 |
7 | 352321263302414 |
oct | 45117745060427 |
9 | 10032572341658 |
10 | 2553351004439 |
11 | 8a4963092594 |
12 | 352a3410315b |
13 | 156a1a781811 |
14 | 8b82349910b |
15 | 46642780b5e |
hex | 2527f946117 |
2553351004439 has 2 divisors, whose sum is σ = 2553351004440. Its totient is φ = 2553351004438.
The previous prime is 2553351004427. The next prime is 2553351004483. The reversal of 2553351004439 is 9344001533552.
2553351004439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (2553351004483) can be obtained adding 2553351004439 to its sum of digits (44).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2553351004439 - 216 = 2553350938903 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2553351004439.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2553351004409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1276675502219 + 1276675502220.
It is an arithmetic number, because the mean of its divisors is an integer number (1276675502220).
Almost surely, 22553351004439 is an apocalyptic number.
2553351004439 is a deficient number, since it is larger than the sum of its proper divisors (1).
2553351004439 is an equidigital number, since it uses as much as digits as its factorization.
2553351004439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 44.
The spelling of 2553351004439 in words is "two trillion, five hundred fifty-three billion, three hundred fifty-one million, four thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •