Base | Representation |
---|---|
bin | 100010000110001… |
… | …1110111010011001 |
3 | 2221201212110202011 |
4 | 1010030132322121 |
5 | 4320343414113 |
6 | 305310305521 |
7 | 40231612444 |
oct | 10414367231 |
9 | 2851773664 |
10 | 1144123033 |
11 | 537911629 |
12 | 27b1b82a1 |
13 | 15305c0a1 |
14 | abd4665b |
15 | 6a69e63d |
hex | 4431ee99 |
1144123033 has 2 divisors, whose sum is σ = 1144123034. Its totient is φ = 1144123032.
The previous prime is 1144123027. The next prime is 1144123037. The reversal of 1144123033 is 3303214411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1129161609 + 14961424 = 33603^2 + 3868^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1144123033 is a prime.
It is a super-2 number, since 2×11441230332 = 2618035029282238178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1144122995 and 1144123013.
It is not a weakly prime, because it can be changed into another prime (1144123037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572061516 + 572061517.
It is an arithmetic number, because the mean of its divisors is an integer number (572061517).
Almost surely, 21144123033 is an apocalyptic number.
It is an amenable number.
1144123033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144123033 is an equidigital number, since it uses as much as digits as its factorization.
1144123033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1144123033 is about 33824.8877751279. The cubic root of 1144123033 is about 1045.9017979627.
Adding to 1144123033 its reverse (3303214411), we get a palindrome (4447337444).
The spelling of 1144123033 in words is "one billion, one hundred forty-four million, one hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •