Base | Representation |
---|---|
bin | 1011000111011010100000… |
… | …0001110011011101011001 |
3 | 1121021102010021010111200222 |
4 | 2301312220001303131121 |
5 | 3100221124224033304 |
6 | 41554413150005425 |
7 | 2401003402261316 |
oct | 261665001633531 |
9 | 47242107114628 |
10 | 12222001002329 |
11 | 3992359a36758 |
12 | 14548574a6875 |
13 | 6a86b6b22021 |
14 | 303795a21d0d |
15 | 162dc7b204be |
hex | b1da8073759 |
12222001002329 has 2 divisors, whose sum is σ = 12222001002330. Its totient is φ = 12222001002328.
The previous prime is 12222001002227. The next prime is 12222001002371. The reversal of 12222001002329 is 92320010022221.
12222001002329 is digitally balanced in base 2, because in such base 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., 6245760719104 + 5976240283225 = 2499152^2 + 2444635^2 .
It is a cyclic number.
It is not a de Polignac number, because 12222001002329 - 28 = 12222001002073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12222001002298 and 12222001002307.
It is not a weakly prime, because it can be changed into another prime (12222001002389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111000501164 + 6111000501165.
It is an arithmetic number, because the mean of its divisors is an integer number (6111000501165).
Almost surely, 212222001002329 is an apocalyptic number.
It is an amenable number.
12222001002329 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222001002329 is an equidigital number, since it uses as much as digits as its factorization.
12222001002329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 12222001002329 in words is "twelve trillion, two hundred twenty-two billion, one million, two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •