Base | Representation |
---|---|
bin | 100010010100001… |
… | …1001100010001001 |
3 | 2222020122021011012 |
4 | 1010220121202021 |
5 | 4324232103113 |
6 | 310131213305 |
7 | 40351041641 |
oct | 10450314211 |
9 | 2866567135 |
10 | 1151441033 |
11 | 540a5a766 |
12 | 281747235 |
13 | 154721c72 |
14 | acccd521 |
15 | 6b147aa8 |
hex | 44a19889 |
1151441033 has 2 divisors, whose sum is σ = 1151441034. Its totient is φ = 1151441032.
The previous prime is 1151440993. The next prime is 1151441051. The reversal of 1151441033 is 3301441511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 893292544 + 258148489 = 29888^2 + 16067^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151441033 - 210 = 1151440009 is a prime.
It is a super-2 number, since 2×11514410332 = 2651632904952214178, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1151441233) 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, 575720516 + 575720517.
It is an arithmetic number, because the mean of its divisors is an integer number (575720517).
Almost surely, 21151441033 is an apocalyptic number.
It is an amenable number.
1151441033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151441033 is an equidigital number, since it uses as much as digits as its factorization.
1151441033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1151441033 is about 33932.8901362675. The cubic root of 1151441033 is about 1048.1269807217.
Adding to 1151441033 its reverse (3301441511), we get a palindrome (4452882544).
The spelling of 1151441033 in words is "one billion, one hundred fifty-one million, four hundred forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •