Base | Representation |
---|---|
bin | 1011000111010011001010… |
… | …0110110101110111011101 |
3 | 1121021020000222020000120211 |
4 | 2301310302212311313131 |
5 | 3100203110414000104 |
6 | 41553445454012421 |
7 | 2400603521445346 |
oct | 261646246656735 |
9 | 47236028200524 |
10 | 12220031000029 |
11 | 3991538a18886 |
12 | 14543a77a7111 |
13 | 6a846194b8a8 |
14 | 30364a1350cd |
15 | 162d0ebd5e04 |
hex | b1d329b5ddd |
12220031000029 has 2 divisors, whose sum is σ = 12220031000030. Its totient is φ = 12220031000028.
The previous prime is 12220031000017. The next prime is 12220031000053. The reversal of 12220031000029 is 92000013002221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9698677632900 + 2521353367129 = 3114270^2 + 1587877^2 .
It is an emirp because it is prime and its reverse (92000013002221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220031000029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12220030999973 and 12220031000009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220031000629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110015500014 + 6110015500015.
It is an arithmetic number, because the mean of its divisors is an integer number (6110015500015).
Almost surely, 212220031000029 is an apocalyptic number.
It is an amenable number.
12220031000029 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220031000029 is an equidigital number, since it uses as much as digits as its factorization.
12220031000029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 12220031000029 in words is "twelve trillion, two hundred twenty billion, thirty-one million, twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •