Base | Representation |
---|---|
bin | 110011110010011010… |
… | …0000010101011101001 |
3 | 101122001121221021212121 |
4 | 1213210310002223221 |
5 | 3310231013430441 |
6 | 123031321111241 |
7 | 11014651105264 |
oct | 1474464025351 |
9 | 348047837777 |
10 | 111213030121 |
11 | 4318a946646 |
12 | 19679028521 |
13 | a6449041cb |
14 | 5550345cdb |
15 | 2d5d858dd1 |
hex | 19e4d02ae9 |
111213030121 has 2 divisors, whose sum is σ = 111213030122. Its totient is φ = 111213030120.
The previous prime is 111213030077. The next prime is 111213030143. The reversal of 111213030121 is 121030312111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105469057600 + 5743972521 = 324760^2 + 75789^2 .
It is an emirp because it is prime and its reverse (121030312111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111213030121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111213030095 and 111213030104.
It is not a weakly prime, because it can be changed into another prime (111213030421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606515060 + 55606515061.
It is an arithmetic number, because the mean of its divisors is an integer number (55606515061).
Almost surely, 2111213030121 is an apocalyptic number.
It is an amenable number.
111213030121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111213030121 is an equidigital number, since it uses as much as digits as its factorization.
111213030121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111213030121 its reverse (121030312111), we get a palindrome (232243342232).
The spelling of 111213030121 in words is "one hundred eleven billion, two hundred thirteen million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •