Base | Representation |
---|---|
bin | 1010010010111110110101… |
… | …1000000001100100010101 |
3 | 1111002022001101020121112112 |
4 | 2210233231120001210111 |
5 | 2440441330124314104 |
6 | 40024521451200405 |
7 | 2245634263320302 |
oct | 244575530014425 |
9 | 44068041217475 |
10 | 11321221323029 |
11 | 3675337325302 |
12 | 132a166146105 |
13 | 641781979427 |
14 | 2b1d42c800a9 |
15 | 149756e3286e |
hex | a4bed601915 |
11321221323029 has 2 divisors, whose sum is σ = 11321221323030. Its totient is φ = 11321221323028.
The previous prime is 11321221322953. The next prime is 11321221323031. The reversal of 11321221323029 is 92032312212311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6665185216804 + 4656036106225 = 2581702^2 + 2157785^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321221323029 - 236 = 11252501846293 is a prime.
Together with 11321221323031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11321221322986 and 11321221323004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321221323229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660610661514 + 5660610661515.
It is an arithmetic number, because the mean of its divisors is an integer number (5660610661515).
Almost surely, 211321221323029 is an apocalyptic number.
It is an amenable number.
11321221323029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321221323029 is an equidigital number, since it uses as much as digits as its factorization.
11321221323029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 11321221323029 in words is "eleven trillion, three hundred twenty-one billion, two hundred twenty-one million, three hundred twenty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •