Base | Representation |
---|---|
bin | 1011000111010011001010… |
… | …0110110110000000110101 |
3 | 1121021020000222020001102001 |
4 | 2301310302212312000311 |
5 | 3100203110414010004 |
6 | 41553445454015301 |
7 | 2400603521450164 |
oct | 261646246660065 |
9 | 47236028201361 |
10 | 12220031000629 |
11 | 3991538a19281 |
12 | 14543a77a7531 |
13 | 6a846194bc4a |
14 | 30364a1353db |
15 | 162d0ebd61a4 |
hex | b1d329b6035 |
12220031000629 has 2 divisors, whose sum is σ = 12220031000630. Its totient is φ = 12220031000628.
The previous prime is 12220031000623. The next prime is 12220031000687. The reversal of 12220031000629 is 92600013002221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9373731339025 + 2846299661604 = 3061655^2 + 1687098^2 .
It is an emirp because it is prime and its reverse (92600013002221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12220031000629 - 239 = 11670275186741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12220031000597 and 12220031000606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220031000623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110015500314 + 6110015500315.
It is an arithmetic number, because the mean of its divisors is an integer number (6110015500315).
Almost surely, 212220031000629 is an apocalyptic number.
It is an amenable number.
12220031000629 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220031000629 is an equidigital number, since it uses as much as digits as its factorization.
12220031000629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 12220031000629 in words is "twelve trillion, two hundred twenty billion, thirty-one million, six hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •