Base | Representation |
---|---|
bin | 100001100000010… |
… | …1000111001111001 |
3 | 2220100110100202012 |
4 | 1003000220321321 |
5 | 4300301203032 |
6 | 303320215305 |
7 | 36600614414 |
oct | 10300507171 |
9 | 2810410665 |
10 | 1124241017 |
11 | 527671a09 |
12 | 27460a535 |
13 | 14bbba593 |
14 | a944cb7b |
15 | 68a736b2 |
hex | 43028e79 |
1124241017 has 2 divisors, whose sum is σ = 1124241018. Its totient is φ = 1124241016.
The previous prime is 1124240939. The next prime is 1124241031. The reversal of 1124241017 is 7101424211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1118969401 + 5271616 = 33451^2 + 2296^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124241017 - 210 = 1124239993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1124240983 and 1124241001.
It is not a weakly prime, because it can be changed into another prime (1124241917) 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, 562120508 + 562120509.
It is an arithmetic number, because the mean of its divisors is an integer number (562120509).
Almost surely, 21124241017 is an apocalyptic number.
It is an amenable number.
1124241017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124241017 is an equidigital number, since it uses as much as digits as its factorization.
1124241017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 23.
The square root of 1124241017 is about 33529.7035030136. The cubic root of 1124241017 is about 1039.8079702773.
Adding to 1124241017 its reverse (7101424211), we get a palindrome (8225665228).
The spelling of 1124241017 in words is "one billion, one hundred twenty-four million, two hundred forty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •