Base | Representation |
---|---|
bin | 101011101100000001101… |
… | …011000101010011001111 |
3 | 101122000020012011121222122 |
4 | 223230001223011103033 |
5 | 343142011303223043 |
6 | 10215110224003155 |
7 | 426621365512022 |
oct | 53540153052317 |
9 | 11560205147878 |
10 | 3002210211023 |
11 | a5825943aa61 |
12 | 405a221604bb |
13 | 18a1516c818a |
14 | a54446711b9 |
15 | 531637cb368 |
hex | 2bb01ac54cf |
3002210211023 has 2 divisors, whose sum is σ = 3002210211024. Its totient is φ = 3002210211022.
The previous prime is 3002210211001. The next prime is 3002210211103. The reversal of 3002210211023 is 3201120122003.
3002210211023 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 is an emirp because it is prime and its reverse (3201120122003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3002210211023 - 26 = 3002210210959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3002210210992 and 3002210211010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3002210211823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1501105105511 + 1501105105512.
It is an arithmetic number, because the mean of its divisors is an integer number (1501105105512).
Almost surely, 23002210211023 is an apocalyptic number.
3002210211023 is a deficient number, since it is larger than the sum of its proper divisors (1).
3002210211023 is an equidigital number, since it uses as much as digits as its factorization.
3002210211023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 3002210211023 its reverse (3201120122003), we get a palindrome (6203330333026).
The spelling of 3002210211023 in words is "three trillion, two billion, two hundred ten million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •