Base | Representation |
---|---|
bin | 101011101100000010101… |
… | …000110010110110111001 |
3 | 101122000021022121112012002 |
4 | 223230002220302312321 |
5 | 343142024423412114 |
6 | 10215112002430345 |
7 | 426621653150303 |
oct | 53540250626671 |
9 | 11560238545162 |
10 | 3002226388409 |
11 | a5826758a2a6 |
12 | 405a276623b5 |
13 | 18a154b706b1 |
14 | a5446882973 |
15 | 53164e247de |
hex | 2bb02a32db9 |
3002226388409 has 2 divisors, whose sum is σ = 3002226388410. Its totient is φ = 3002226388408.
The previous prime is 3002226388391. The next prime is 3002226388411. The reversal of 3002226388409 is 9048836222003.
It is a happy number.
3002226388409 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2927726323600 + 74500064809 = 1711060^2 + 272947^2 .
It is a cyclic number.
It is not a de Polignac number, because 3002226388409 - 232 = 2997931421113 is a prime.
Together with 3002226388411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3002226388489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1501113194204 + 1501113194205.
It is an arithmetic number, because the mean of its divisors is an integer number (1501113194205).
Almost surely, 23002226388409 is an apocalyptic number.
It is an amenable number.
3002226388409 is a deficient number, since it is larger than the sum of its proper divisors (1).
3002226388409 is an equidigital number, since it uses as much as digits as its factorization.
3002226388409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 995328, while the sum is 47.
The spelling of 3002226388409 in words is "three trillion, two billion, two hundred twenty-six million, three hundred eighty-eight thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •