Base | Representation |
---|---|
bin | 100001000111001… |
… | …0010100101110101 |
3 | 2212102121210200022 |
4 | 1002032102211311 |
5 | 4233411324141 |
6 | 302125254525 |
7 | 36350463506 |
oct | 10216224565 |
9 | 2772553608 |
10 | 1111042421 |
11 | 520177685 |
12 | 270104445 |
13 | 149248b68 |
14 | a77b4bad |
15 | 67817b4b |
hex | 42392975 |
1111042421 has 2 divisors, whose sum is σ = 1111042422. Its totient is φ = 1111042420.
The previous prime is 1111042397. The next prime is 1111042433. The reversal of 1111042421 is 1242401111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 734139025 + 376903396 = 27095^2 + 19414^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111042421 - 222 = 1106848117 is a prime.
It is a super-2 number, since 2×11110424212 = 2468830522523082482, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1111042421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111042451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555521210 + 555521211.
It is an arithmetic number, because the mean of its divisors is an integer number (555521211).
Almost surely, 21111042421 is an apocalyptic number.
It is an amenable number.
1111042421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111042421 is an equidigital number, since it uses as much as digits as its factorization.
1111042421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1111042421 is about 33332.3029657418. The cubic root of 1111042421 is about 1035.7228245968.
Adding to 1111042421 its reverse (1242401111), we get a palindrome (2353443532).
The spelling of 1111042421 in words is "one billion, one hundred eleven million, forty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •