Base | Representation |
---|---|
bin | 101000010011110111000… |
… | …001001010101110011101 |
3 | 100210211010020220122202102 |
4 | 220103313001022232131 |
5 | 330341132410421203 |
6 | 5520322353334445 |
7 | 404063511562424 |
oct | 50236701125635 |
9 | 10724106818672 |
10 | 2770103217053 |
11 | 97888105aaa7 |
12 | 388a45b67425 |
13 | 1712b1647823 |
14 | 981063982bb |
15 | 4c0cb783888 |
hex | 284f704ab9d |
2770103217053 has 2 divisors, whose sum is σ = 2770103217054. Its totient is φ = 2770103217052.
The previous prime is 2770103216999. The next prime is 2770103217113. The reversal of 2770103217053 is 3507123010772.
2770103217053 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., 1799362008409 + 970741208644 = 1341403^2 + 985262^2 .
It is a cyclic number.
It is not a de Polignac number, because 2770103217053 - 224 = 2770086439837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2770103216998 and 2770103217016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2770109217053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1385051608526 + 1385051608527.
It is an arithmetic number, because the mean of its divisors is an integer number (1385051608527).
Almost surely, 22770103217053 is an apocalyptic number.
It is an amenable number.
2770103217053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2770103217053 is an equidigital number, since it uses as much as digits as its factorization.
2770103217053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61740, while the sum is 38.
The spelling of 2770103217053 in words is "two trillion, seven hundred seventy billion, one hundred three million, two hundred seventeen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •