Base | Representation |
---|---|
bin | 1010111011110001100000… |
… | …1111001101111010011101 |
3 | 1120120021221020210021112211 |
4 | 2232330120033031322131 |
5 | 3033432044121310322 |
6 | 41322501221200421 |
7 | 2350363602551662 |
oct | 256743017157235 |
9 | 46507836707484 |
10 | 12022020103837 |
11 | 3915567a31827 |
12 | 1421b46260111 |
13 | 692896760323 |
14 | 2d7c242b3a69 |
15 | 15cac11c0b77 |
hex | aef183cde9d |
12022020103837 has 2 divisors, whose sum is σ = 12022020103838. Its totient is φ = 12022020103836.
The previous prime is 12022020103831. The next prime is 12022020103913. The reversal of 12022020103837 is 73830102022021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11792431548121 + 229588555716 = 3434011^2 + 479154^2 .
It is a cyclic number.
It is not a de Polignac number, because 12022020103837 - 23 = 12022020103829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12022020103799 and 12022020103808.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12022020103831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6011010051918 + 6011010051919.
It is an arithmetic number, because the mean of its divisors is an integer number (6011010051919).
Almost surely, 212022020103837 is an apocalyptic number.
It is an amenable number.
12022020103837 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022020103837 is an equidigital number, since it uses as much as digits as its factorization.
12022020103837 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 12022020103837 its reverse (73830102022021), we get a palindrome (85852122125858).
The spelling of 12022020103837 in words is "twelve trillion, twenty-two billion, twenty million, one hundred three thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •