Base | Representation |
---|---|
bin | 1011000110101110100010… |
… | …1000100011111000101101 |
3 | 1121020021122211110120201011 |
4 | 2301223220220203320231 |
5 | 3100022442200031333 |
6 | 41545142145345221 |
7 | 2400105065364652 |
oct | 261535050437055 |
9 | 47207584416634 |
10 | 12210200002093 |
11 | 39883536445a5 |
12 | 1452503338211 |
13 | 6a7555c84452 |
14 | 302d96605c29 |
15 | 162936aac9cd |
hex | b1ae8a23e2d |
12210200002093 has 2 divisors, whose sum is σ = 12210200002094. Its totient is φ = 12210200002092.
The previous prime is 12210200002079. The next prime is 12210200002141. The reversal of 12210200002093 is 39020000201221.
12210200002093 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., 7536985057449 + 4673214944644 = 2745357^2 + 2161762^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12210200002093 is a prime.
It is a super-2 number, since 2×122102000020932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210200002073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105100001046 + 6105100001047.
It is an arithmetic number, because the mean of its divisors is an integer number (6105100001047).
Almost surely, 212210200002093 is an apocalyptic number.
It is an amenable number.
12210200002093 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210200002093 is an equidigital number, since it uses as much as digits as its factorization.
12210200002093 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 12210200002093 in words is "twelve trillion, two hundred ten billion, two hundred million, two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •