Base | Representation |
---|---|
bin | 100001100000000… |
… | …1110101000010101 |
3 | 2220100020220010021 |
4 | 1003000032220111 |
5 | 4300234232042 |
6 | 303314025141 |
7 | 36566655562 |
oct | 10300165025 |
9 | 2810226107 |
10 | 1124133397 |
11 | 5275a9072 |
12 | 2745781b1 |
13 | 14bb805ba |
14 | a9421869 |
15 | 68a51867 |
hex | 4300ea15 |
1124133397 has 2 divisors, whose sum is σ = 1124133398. Its totient is φ = 1124133396.
The previous prime is 1124133389. The next prime is 1124133407. The reversal of 1124133397 is 7933314211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 601279441 + 522853956 = 24521^2 + 22866^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124133397 - 23 = 1124133389 is a prime.
It is a super-3 number, since 3×11241333973 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1124133317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562066698 + 562066699.
It is an arithmetic number, because the mean of its divisors is an integer number (562066699).
Almost surely, 21124133397 is an apocalyptic number.
It is an amenable number.
1124133397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124133397 is an equidigital number, since it uses as much as digits as its factorization.
1124133397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608, while the sum is 34.
The square root of 1124133397 is about 33528.0986189196. The cubic root of 1124133397 is about 1039.7747900538.
The spelling of 1124133397 in words is "one billion, one hundred twenty-four million, one hundred thirty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •