Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0000111101111010000101 |
3 | 1121021012221211002010200022 |
4 | 2301310300300331322011 |
5 | 3100203030011144343 |
6 | 41553442431424525 |
7 | 2400602665010621 |
oct | 261646060757205 |
9 | 47235854063608 |
10 | 12220000099973 |
11 | 3991522533146 |
12 | 1454399385145 |
13 | 6a8458420033 |
14 | 303645db0181 |
15 | 162d0c130568 |
hex | b1d30c3de85 |
12220000099973 has 2 divisors, whose sum is σ = 12220000099974. Its totient is φ = 12220000099972.
The previous prime is 12220000099919. The next prime is 12220000100041. The reversal of 12220000099973 is 37999000002221.
12220000099973 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., 7043201133409 + 5176798966564 = 2653903^2 + 2275258^2 .
It is an emirp because it is prime and its reverse (37999000002221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12220000099973 - 234 = 12202820230789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220000099273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110000049986 + 6110000049987.
It is an arithmetic number, because the mean of its divisors is an integer number (6110000049987).
Almost surely, 212220000099973 is an apocalyptic number.
It is an amenable number.
12220000099973 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220000099973 is an equidigital number, since it uses as much as digits as its factorization.
12220000099973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 122472, while the sum is 44.
The spelling of 12220000099973 in words is "twelve trillion, two hundred twenty billion, ninety-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •