Base | Representation |
---|---|
bin | 11101011001011110110… |
… | …00010010100011111001 |
3 | 10120120021110022222102112 |
4 | 32230233120102203321 |
5 | 113022202211224233 |
6 | 2052012242142105 |
7 | 132656344062221 |
oct | 16545730224371 |
9 | 3516243288375 |
10 | 1010112211193 |
11 | 35a428011928 |
12 | 143924651935 |
13 | 7433a2b3967 |
14 | 36c65459081 |
15 | 1b41e3dc048 |
hex | eb2f6128f9 |
1010112211193 has 2 divisors, whose sum is σ = 1010112211194. Its totient is φ = 1010112211192.
The previous prime is 1010112211177. The next prime is 1010112211231. The reversal of 1010112211193 is 3911122110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 657545835664 + 352566375529 = 810892^2 + 593773^2 .
It is an emirp because it is prime and its reverse (3911122110101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010112211193 - 24 = 1010112211177 is a prime.
It is a super-3 number, since 3×10101122111933 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1010112213193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505056105596 + 505056105597.
It is an arithmetic number, because the mean of its divisors is an integer number (505056105597).
Almost surely, 21010112211193 is an apocalyptic number.
It is an amenable number.
1010112211193 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010112211193 is an equidigital number, since it uses as much as digits as its factorization.
1010112211193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 23.
Adding to 1010112211193 its reverse (3911122110101), we get a palindrome (4921234321294).
The spelling of 1010112211193 in words is "one trillion, ten billion, one hundred twelve million, two hundred eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •