Base | Representation |
---|---|
bin | 100001100000100… |
… | …1001111101010001 |
3 | 2220100201020110102 |
4 | 1003001021331101 |
5 | 4300320021101 |
6 | 303323142145 |
7 | 36602020211 |
oct | 10301117521 |
9 | 2810636412 |
10 | 1124376401 |
11 | 5277546a5 |
12 | 274674955 |
13 | 14bc370a5 |
14 | a9486241 |
15 | 68a9d86b |
hex | 43049f51 |
1124376401 has 2 divisors, whose sum is σ = 1124376402. Its totient is φ = 1124376400.
The previous prime is 1124376391. The next prime is 1124376521. The reversal of 1124376401 is 1046734211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 651270400 + 473106001 = 25520^2 + 21751^2 .
It is an emirp because it is prime and its reverse (1046734211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1124376401 - 210 = 1124375377 is a prime.
It is a super-2 number, since 2×11243764012 = 2528444582251425602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1124376301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562188200 + 562188201.
It is an arithmetic number, because the mean of its divisors is an integer number (562188201).
Almost surely, 21124376401 is an apocalyptic number.
It is an amenable number.
1124376401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124376401 is an equidigital number, since it uses as much as digits as its factorization.
1124376401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 1124376401 is about 33531.7223088824. The cubic root of 1124376401 is about 1039.8497073870.
The spelling of 1124376401 in words is "one billion, one hundred twenty-four million, three hundred seventy-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •