Base | Representation |
---|---|
bin | 100110100111000100001… |
… | …011000110011111101001 |
3 | 100101122121001211112101222 |
4 | 212213010023012133221 |
5 | 321432412213104103 |
6 | 5350523000351425 |
7 | 362456621305442 |
oct | 46470413063751 |
9 | 10348531745358 |
10 | 2653286066153 |
11 | 9332858a4588 |
12 | 36a284175575 |
13 | 1632859a5628 |
14 | 925c3a542c9 |
15 | 49040e3e638 |
hex | 269c42c67e9 |
2653286066153 has 2 divisors, whose sum is σ = 2653286066154. Its totient is φ = 2653286066152.
The previous prime is 2653286066143. The next prime is 2653286066219. The reversal of 2653286066153 is 3516606823562.
2653286066153 is digitally balanced in base 2, 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., 1740731919424 + 912554146729 = 1319368^2 + 955277^2 .
It is a cyclic number.
It is not a de Polignac number, because 2653286066153 - 230 = 2652212324329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2653286066095 and 2653286066104.
It is not a weakly prime, because it can be changed into another prime (2653286066113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1326643033076 + 1326643033077.
It is an arithmetic number, because the mean of its divisors is an integer number (1326643033077).
Almost surely, 22653286066153 is an apocalyptic number.
It is an amenable number.
2653286066153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2653286066153 is an equidigital number, since it uses as much as digits as its factorization.
2653286066153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9331200, while the sum is 53.
The spelling of 2653286066153 in words is "two trillion, six hundred fifty-three billion, two hundred eighty-six million, sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •