Base | Representation |
---|---|
bin | 111010011000011111001… |
… | …001110010011110100101 |
3 | 112012112201201102101021112 |
4 | 322120133021302132211 |
5 | 1011213110130123323 |
6 | 12311033021354405 |
7 | 562600435202561 |
oct | 72303711623645 |
9 | 15175651371245 |
10 | 4012022114213 |
11 | 1307541987a53 |
12 | 549682108a05 |
13 | 231441703a99 |
14 | dc27bc766a1 |
15 | 6e566648178 |
hex | 3a61f2727a5 |
4012022114213 has 2 divisors, whose sum is σ = 4012022114214. Its totient is φ = 4012022114212.
The previous prime is 4012022114201. The next prime is 4012022114227. The reversal of 4012022114213 is 3124112202104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2240509029889 + 1771513084324 = 1496833^2 + 1330982^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4012022114213 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4012022144213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2006011057106 + 2006011057107.
It is an arithmetic number, because the mean of its divisors is an integer number (2006011057107).
Almost surely, 24012022114213 is an apocalyptic number.
It is an amenable number.
4012022114213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4012022114213 is an equidigital number, since it uses as much as digits as its factorization.
4012022114213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 4012022114213 its reverse (3124112202104), we get a palindrome (7136134316317).
The spelling of 4012022114213 in words is "four trillion, twelve billion, twenty-two million, one hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •