Base | Representation |
---|---|
bin | 11101111110101110110… |
… | …10000010100011011111 |
3 | 10122110220012210101000212 |
4 | 32333113122002203133 |
5 | 113334131421031031 |
6 | 2105120532043035 |
7 | 134265053655545 |
oct | 16772732024337 |
9 | 3573805711025 |
10 | 1030111111391 |
11 | 36795a95a61a |
12 | 14778616347b |
13 | 761a6694b0b |
14 | 37c01535d95 |
15 | 1bbdeedc12b |
hex | efd76828df |
1030111111391 has 2 divisors, whose sum is σ = 1030111111392. Its totient is φ = 1030111111390.
The previous prime is 1030111111279. The next prime is 1030111111397. The reversal of 1030111111391 is 1931111110301.
It is a strong prime.
It is an emirp because it is prime and its reverse (1931111110301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1030111111391 - 214 = 1030111095007 is a prime.
It is a super-2 number, since 2×10301111113912 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030111111397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515055555695 + 515055555696.
It is an arithmetic number, because the mean of its divisors is an integer number (515055555696).
Almost surely, 21030111111391 is an apocalyptic number.
1030111111391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030111111391 is an equidigital number, since it uses as much as digits as its factorization.
1030111111391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 23.
Adding to 1030111111391 its reverse (1931111110301), we get a palindrome (2961222221692).
The spelling of 1030111111391 in words is "one trillion, thirty billion, one hundred eleven million, one hundred eleven thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •