Base | Representation |
---|---|
bin | 100010001000100… |
… | …1010100100100001 |
3 | 2221211011211102102 |
4 | 1010101022210201 |
5 | 4321202203213 |
6 | 305352500145 |
7 | 40245214043 |
oct | 10421124441 |
9 | 2854154372 |
10 | 1145350433 |
11 | 53857a807 |
12 | 27b6aa655 |
13 | 15339b966 |
14 | ac185a93 |
15 | 6a843158 |
hex | 4444a921 |
1145350433 has 2 divisors, whose sum is σ = 1145350434. Its totient is φ = 1145350432.
The previous prime is 1145350373. The next prime is 1145350439. The reversal of 1145350433 is 3340535411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 639685264 + 505665169 = 25292^2 + 22487^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145350433 - 28 = 1145350177 is a prime.
It is a super-2 number, since 2×11453504332 = 2623655228746574978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145350396 and 1145350405.
It is not a weakly prime, because it can be changed into another prime (1145350439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572675216 + 572675217.
It is an arithmetic number, because the mean of its divisors is an integer number (572675217).
Almost surely, 21145350433 is an apocalyptic number.
It is an amenable number.
1145350433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145350433 is an equidigital number, since it uses as much as digits as its factorization.
1145350433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 1145350433 is about 33843.0263569912. The cubic root of 1145350433 is about 1046.2756741524.
Adding to 1145350433 its reverse (3340535411), we get a palindrome (4485885844).
The spelling of 1145350433 in words is "one billion, one hundred forty-five million, three hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •