Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0000110010000010001101 |
3 | 1022210121022101011101121201 |
4 | 2103020213300302002031 |
5 | 2311124332122122221 |
6 | 33300534415225501 |
7 | 2062332334631236 |
oct | 223104760620215 |
9 | 38717271141551 |
10 | 10111020114061 |
11 | 32490722959a9 |
12 | 1173700218291 |
13 | 584607ab58c9 |
14 | 26d5399b808d |
15 | 128026891891 |
hex | 93227c3208d |
10111020114061 has 2 divisors, whose sum is σ = 10111020114062. Its totient is φ = 10111020114060.
The previous prime is 10111020114047. The next prime is 10111020114119. The reversal of 10111020114061 is 16041102011101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10070531028100 + 40489085961 = 3173410^2 + 201219^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111020114061 - 211 = 10111020112013 is a prime.
It is a super-2 number, since 2×101110201140612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111020114001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055510057030 + 5055510057031.
It is an arithmetic number, because the mean of its divisors is an integer number (5055510057031).
Almost surely, 210111020114061 is an apocalyptic number.
It is an amenable number.
10111020114061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111020114061 is an equidigital number, since it uses as much as digits as its factorization.
10111020114061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 10111020114061 its reverse (16041102011101), we get a palindrome (26152122125162).
The spelling of 10111020114061 in words is "ten trillion, one hundred eleven billion, twenty million, one hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •