Base | Representation |
---|---|
bin | 100010001000100… |
… | …0000110011100101 |
3 | 2221211002210120002 |
4 | 1010101000303211 |
5 | 4321144413222 |
6 | 305351551045 |
7 | 40244656325 |
oct | 10421006345 |
9 | 2854083502 |
10 | 1145310437 |
11 | 538552757 |
12 | 27b68b485 |
13 | 1533866ab |
14 | ac175285 |
15 | 6a836392 |
hex | 44440ce5 |
1145310437 has 2 divisors, whose sum is σ = 1145310438. Its totient is φ = 1145310436.
The previous prime is 1145310433. The next prime is 1145310487. The reversal of 1145310437 is 7340135411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1098988801 + 46321636 = 33151^2 + 6806^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145310437 - 22 = 1145310433 is a prime.
It is a super-2 number, since 2×11453104372 = 2623471994202261938, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1145310433) 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, 572655218 + 572655219.
It is an arithmetic number, because the mean of its divisors is an integer number (572655219).
Almost surely, 21145310437 is an apocalyptic number.
It is an amenable number.
1145310437 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145310437 is an equidigital number, since it uses as much as digits as its factorization.
1145310437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 1145310437 is about 33842.4354472310. The cubic root of 1145310437 is about 1046.2634952513.
Adding to 1145310437 its reverse (7340135411), we get a palindrome (8485445848).
The spelling of 1145310437 in words is "one billion, one hundred forty-five million, three hundred ten thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •