Base | Representation |
---|---|
bin | 1011000000011011100000… |
… | …0100101111000110101101 |
3 | 1120211221101222000000220121 |
4 | 2300012320010233012231 |
5 | 3041234404321401333 |
6 | 41423330454244541 |
7 | 2356225055154514 |
oct | 260067004570655 |
9 | 46757358000817 |
10 | 12102011122093 |
11 | 3946485863782 |
12 | 143554b056751 |
13 | 69a2a3a6bba9 |
14 | 2dba51b9167b |
15 | 15ec039b832d |
hex | b01b812f1ad |
12102011122093 has 2 divisors, whose sum is σ = 12102011122094. Its totient is φ = 12102011122092.
The previous prime is 12102011122079. The next prime is 12102011122127. The reversal of 12102011122093 is 39022111020121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11424487880169 + 677523241924 = 3380013^2 + 823118^2 .
It is an emirp because it is prime and its reverse (39022111020121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12102011122093 is a prime.
It is a super-3 number, since 3×121020111220933 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102011125093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051005561046 + 6051005561047.
It is an arithmetic number, because the mean of its divisors is an integer number (6051005561047).
Almost surely, 212102011122093 is an apocalyptic number.
It is an amenable number.
12102011122093 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102011122093 is an equidigital number, since it uses as much as digits as its factorization.
12102011122093 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 25.
The spelling of 12102011122093 in words is "twelve trillion, one hundred two billion, eleven million, one hundred twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •