Base | Representation |
---|---|
bin | 100001110010111… |
… | …1100111100100001 |
3 | 2221000212022022212 |
4 | 1003211330330201 |
5 | 4310302204213 |
6 | 304310011505 |
7 | 40050013565 |
oct | 10345747441 |
9 | 2830768285 |
10 | 1134022433 |
11 | 532142925 |
12 | 277946b95 |
13 | 150c337bb |
14 | aa8776a5 |
15 | 698569a8 |
hex | 4397cf21 |
1134022433 has 2 divisors, whose sum is σ = 1134022434. Its totient is φ = 1134022432.
The previous prime is 1134022343. The next prime is 1134022447. The reversal of 1134022433 is 3342204311.
Together with previous prime (1134022343) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 927324304 + 206698129 = 30452^2 + 14377^2 .
It is a cyclic number.
It is not a de Polignac number, because 1134022433 - 230 = 60280609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1134022399 and 1134022408.
It is not a weakly prime, because it can be changed into another prime (1134022453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567011216 + 567011217.
It is an arithmetic number, because the mean of its divisors is an integer number (567011217).
Almost surely, 21134022433 is an apocalyptic number.
It is an amenable number.
1134022433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134022433 is an equidigital number, since it uses as much as digits as its factorization.
1134022433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 1134022433 is about 33675.2495610649. The cubic root of 1134022433 is about 1042.8148697615.
Adding to 1134022433 its reverse (3342204311), we get a palindrome (4476226744).
The spelling of 1134022433 in words is "one billion, one hundred thirty-four million, twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •