Base | Representation |
---|---|
bin | 100001000010001010111… |
… | …011100010101110010101 |
3 | 22001000110022222002012021 |
4 | 201002022323202232111 |
5 | 244143102320044241 |
6 | 4454505111253141 |
7 | 323002353125512 |
oct | 41021273425625 |
9 | 8030408862167 |
10 | 2270073596821 |
11 | 7a5807401478 |
12 | 307b5707a1b1 |
13 | 1360b43288b4 |
14 | 7bc2d264309 |
15 | 3e0b324e0d1 |
hex | 2108aee2b95 |
2270073596821 has 2 divisors, whose sum is σ = 2270073596822. Its totient is φ = 2270073596820.
The previous prime is 2270073596803. The next prime is 2270073596863. The reversal of 2270073596821 is 1286953700722.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1678229566225 + 591844030596 = 1295465^2 + 769314^2 .
It is a cyclic number.
It is not a de Polignac number, because 2270073596821 - 25 = 2270073596789 is a prime.
It is a super-2 number, since 2×22700735968212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2270073596521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1135036798410 + 1135036798411.
It is an arithmetic number, because the mean of its divisors is an integer number (1135036798411).
Almost surely, 22270073596821 is an apocalyptic number.
It is an amenable number.
2270073596821 is a deficient number, since it is larger than the sum of its proper divisors (1).
2270073596821 is an equidigital number, since it uses as much as digits as its factorization.
2270073596821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 52.
The spelling of 2270073596821 in words is "two trillion, two hundred seventy billion, seventy-three million, five hundred ninety-six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •