Base | Representation |
---|---|
bin | 100010001001100… |
… | …0111101111011101 |
3 | 2221212010212201022 |
4 | 1010103013233131 |
5 | 4321320110013 |
6 | 305411453525 |
7 | 40252450562 |
oct | 10423075735 |
9 | 2855125638 |
10 | 1145863133 |
11 | 53889aa28 |
12 | 27b8b72a5 |
13 | 15351b12c |
14 | ac27a869 |
15 | 6a8e5008 |
hex | 444c7bdd |
1145863133 has 2 divisors, whose sum is σ = 1145863134. Its totient is φ = 1145863132.
The previous prime is 1145863129. The next prime is 1145863139. The reversal of 1145863133 is 3313685411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1145280964 + 582169 = 33842^2 + 763^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145863133 - 22 = 1145863129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1145863093 and 1145863102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1145863139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572931566 + 572931567.
It is an arithmetic number, because the mean of its divisors is an integer number (572931567).
Almost surely, 21145863133 is an apocalyptic number.
It is an amenable number.
1145863133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145863133 is an equidigital number, since it uses as much as digits as its factorization.
1145863133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 35.
The square root of 1145863133 is about 33850.6001867027. The cubic root of 1145863133 is about 1046.4317677233.
The spelling of 1145863133 in words is "one billion, one hundred forty-five million, eight hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •