Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0001011011101100111001 |
3 | 1121021012221211022100002011 |
4 | 2301310300301123230321 |
5 | 3100203030024101014 |
6 | 41553442434205521 |
7 | 2400602666026456 |
oct | 261646061335471 |
9 | 47235854270064 |
10 | 12220000222009 |
11 | 39915226068a8 |
12 | 14543994238a1 |
13 | 6a8458463748 |
14 | 30364600282d |
15 | 162d0c1567c4 |
hex | b1d30c5bb39 |
12220000222009 has 8 divisors (see below), whose sum is σ = 12359954090880. Its totient is φ = 12080105253216.
The previous prime is 12220000221997. The next prime is 12220000222021. The reversal of 12220000222009 is 90022200002221.
It is an interprime number because it is at equal distance from previous prime (12220000221997) and next prime (12220000222021).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12220000222009 - 25 = 12220000221977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12220000222709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14307637 + ... + 15137650.
It is an arithmetic number, because the mean of its divisors is an integer number (1544994261360).
Almost surely, 212220000222009 is an apocalyptic number.
It is an amenable number.
12220000222009 is a deficient number, since it is larger than the sum of its proper divisors (139953868871).
12220000222009 is an equidigital number, since it uses as much as digits as its factorization.
12220000222009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29450039.
The product of its (nonzero) digits is 576, while the sum is 22.
The spelling of 12220000222009 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •