Base | Representation |
---|---|
bin | 10101001111101101… |
… | …11001100001000111 |
3 | 1002102220121222120002 |
4 | 22213312321201013 |
5 | 141324431333111 |
6 | 5123452431515 |
7 | 552440300114 |
oct | 124766714107 |
9 | 32386558502 |
10 | 11406121031 |
11 | 4923504608 |
12 | 2263a7859b |
13 | 10ca100056 |
14 | 7a2bc990b |
15 | 46b56163b |
hex | 2a7db9847 |
11406121031 has 2 divisors, whose sum is σ = 11406121032. Its totient is φ = 11406121030.
The previous prime is 11406120893. The next prime is 11406121033. The reversal of 11406121031 is 13012160411.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11406121031 - 222 = 11401926727 is a prime.
It is a super-2 number, since 2×114061210312 (a number of 21 digits) contains 22 as substring.
Together with 11406121033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11406120994 and 11406121012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11406121033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5703060515 + 5703060516.
It is an arithmetic number, because the mean of its divisors is an integer number (5703060516).
Almost surely, 211406121031 is an apocalyptic number.
11406121031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11406121031 is an equidigital number, since it uses as much as digits as its factorization.
11406121031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11406121031 its reverse (13012160411), we get a palindrome (24418281442).
The spelling of 11406121031 in words is "eleven billion, four hundred six million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •