Base | Representation |
---|---|
bin | 1001001001100100110100… |
… | …00110001010001000011101 |
3 | 2122020110210011202221012221 |
4 | 10210302122012022020131 |
5 | 10114122143300320333 |
6 | 110443033045025341 |
7 | 4144431420131131 |
oct | 444623206121035 |
9 | 78213704687187 |
10 | 20120212120093 |
11 | 6457a30233118 |
12 | 230b5223b5251 |
13 | b2c435409c47 |
14 | 4d7b7581d3c1 |
15 | 24d58d78bd2d |
hex | 124c9a18a21d |
20120212120093 has 2 divisors, whose sum is σ = 20120212120094. Its totient is φ = 20120212120092.
The previous prime is 20120212119971. The next prime is 20120212120109. The reversal of 20120212120093 is 39002121202102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17029834465284 + 3090377654809 = 4126722^2 + 1757947^2 .
It is a cyclic number.
It is not a de Polignac number, because 20120212120093 - 225 = 20120178565661 is a prime.
It is a super-3 number, since 3×201202121200933 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20120212160093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060106060046 + 10060106060047.
It is an arithmetic number, because the mean of its divisors is an integer number (10060106060047).
Almost surely, 220120212120093 is an apocalyptic number.
It is an amenable number.
20120212120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120212120093 is an equidigital number, since it uses as much as digits as its factorization.
20120212120093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 20120212120093 its reverse (39002121202102), we get a palindrome (59122333322195).
The spelling of 20120212120093 in words is "twenty trillion, one hundred twenty billion, two hundred twelve million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •