Base | Representation |
---|---|
bin | 100001101101010… |
… | …0000100001010111 |
3 | 2220211012220002101 |
4 | 1003122200201113 |
5 | 4304020204143 |
6 | 304121422531 |
7 | 40012350316 |
oct | 10332404127 |
9 | 2824186071 |
10 | 1131022423 |
11 | 530483983 |
12 | 27693aa47 |
13 | 15042314b |
14 | aa2d627d |
15 | 69462b4d |
hex | 436a0857 |
1131022423 has 2 divisors, whose sum is σ = 1131022424. Its totient is φ = 1131022422.
The previous prime is 1131022391. The next prime is 1131022441. The reversal of 1131022423 is 3242201311.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1131022423 - 25 = 1131022391 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131022423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131022463) 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, 565511211 + 565511212.
It is an arithmetic number, because the mean of its divisors is an integer number (565511212).
Almost surely, 21131022423 is an apocalyptic number.
1131022423 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131022423 is an equidigital number, since it uses as much as digits as its factorization.
1131022423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1131022423 is about 33630.6768144800. The cubic root of 1131022423 is about 1041.8944829622.
Adding to 1131022423 its reverse (3242201311), we get a palindrome (4373223734).
It can be divided in two parts, 11310 and 22423, that added together give a palindrome (33733).
The spelling of 1131022423 in words is "one billion, one hundred thirty-one million, twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •