Base | Representation |
---|---|
bin | 1001001100100011001100… |
… | …1101001110011110000101 |
3 | 1022210121210202110022011121 |
4 | 2103020303031032132011 |
5 | 2311130230300314231 |
6 | 33301005434433541 |
7 | 2062340155642162 |
oct | 223106315163605 |
9 | 38717722408147 |
10 | 10111212119941 |
11 | 3249160708849 |
12 | 11737545928b1 |
13 | 58463880135a |
14 | 26d5572b9069 |
15 | 12803866c311 |
hex | 9323334e785 |
10111212119941 has 2 divisors, whose sum is σ = 10111212119942. Its totient is φ = 10111212119940.
The previous prime is 10111212119903. The next prime is 10111212120091. The reversal of 10111212119941 is 14991121211101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10011870535716 + 99341584225 = 3164154^2 + 315185^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111212119941 - 217 = 10111211988869 is a prime.
It is a super-2 number, since 2×101112121199412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10111212119897 and 10111212119906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111212119741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055606059970 + 5055606059971.
It is an arithmetic number, because the mean of its divisors is an integer number (5055606059971).
Almost surely, 210111212119941 is an apocalyptic number.
It is an amenable number.
10111212119941 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111212119941 is an equidigital number, since it uses as much as digits as its factorization.
10111212119941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 34.
The spelling of 10111212119941 in words is "ten trillion, one hundred eleven billion, two hundred twelve million, one hundred nineteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •