Base | Representation |
---|---|
bin | 100010001000001… |
… | …0100110100000001 |
3 | 2221210202122101011 |
4 | 1010100110310001 |
5 | 4321123131431 |
6 | 305344040521 |
7 | 40243306063 |
oct | 10420246401 |
9 | 2853678334 |
10 | 1145130241 |
11 | 53843a332 |
12 | 27b603141 |
13 | 153322678 |
14 | ac129733 |
15 | 6a7eccb1 |
hex | 44414d01 |
1145130241 has 2 divisors, whose sum is σ = 1145130242. Its totient is φ = 1145130240.
The previous prime is 1145130229. The next prime is 1145130263. The reversal of 1145130241 is 1420315411.
It is an a-pointer prime, because the next prime (1145130263) can be obtained adding 1145130241 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 883337841 + 261792400 = 29721^2 + 16180^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145130241 - 213 = 1145122049 is a prime.
It is a super-2 number, since 2×11451302412 = 2622646537705436162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1145130271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572565120 + 572565121.
It is an arithmetic number, because the mean of its divisors is an integer number (572565121).
Almost surely, 21145130241 is an apocalyptic number.
It is an amenable number.
1145130241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145130241 is an equidigital number, since it uses as much as digits as its factorization.
1145130241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 1145130241 is about 33839.7730636599. The cubic root of 1145130241 is about 1046.2086215160.
Adding to 1145130241 its reverse (1420315411), we get a palindrome (2565445652).
The spelling of 1145130241 in words is "one billion, one hundred forty-five million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •