Base | Representation |
---|---|
bin | 100001001001010… |
… | …1111111111001001 |
3 | 2212111211012012212 |
4 | 1002102233333021 |
5 | 4234211231101 |
6 | 302210314505 |
7 | 36363432560 |
oct | 10222577711 |
9 | 2774735185 |
10 | 1112211401 |
11 | 5208a5984 |
12 | 270588a35 |
13 | 149567c72 |
14 | a79dabd7 |
15 | 679991bb |
hex | 424affc9 |
1112211401 has 4 divisors (see below), whose sum is σ = 1271098752. Its totient is φ = 953324052.
The previous prime is 1112211389. The next prime is 1112211433. The reversal of 1112211401 is 1041122111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1112211401 - 226 = 1045102537 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1112211461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79443665 + ... + 79443678.
It is an arithmetic number, because the mean of its divisors is an integer number (317774688).
Almost surely, 21112211401 is an apocalyptic number.
It is an amenable number.
1112211401 is a deficient number, since it is larger than the sum of its proper divisors (158887351).
1112211401 is an equidigital number, since it uses as much as digits as its factorization.
1112211401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158887350.
The product of its (nonzero) digits is 16, while the sum is 14.
The square root of 1112211401 is about 33349.8335977858. The cubic root of 1112211401 is about 1036.0859415122.
Adding to 1112211401 its reverse (1041122111), we get a palindrome (2153333512).
The spelling of 1112211401 in words is "one billion, one hundred twelve million, two hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •