Base | Representation |
---|---|
bin | 100010001010000… |
… | …1110000100101101 |
3 | 2221212200111212221 |
4 | 1010110032010231 |
5 | 4321403314323 |
6 | 305421555341 |
7 | 40255060504 |
oct | 10424160455 |
9 | 2855614787 |
10 | 1146151213 |
11 | 538a77409 |
12 | 27ba15b51 |
13 | 1535bc2ac |
14 | ac31383b |
15 | 6a95055d |
hex | 4450e12d |
1146151213 has 2 divisors, whose sum is σ = 1146151214. Its totient is φ = 1146151212.
The previous prime is 1146151207. The next prime is 1146151219. The reversal of 1146151213 is 3121516411.
It is a balanced prime because it is at equal distance from previous prime (1146151207) and next prime (1146151219).
It can be written as a sum of positive squares in only one way, i.e., 1080897129 + 65254084 = 32877^2 + 8078^2 .
It is a cyclic number.
It is not a de Polignac number, because 1146151213 - 225 = 1112596781 is a prime.
It is a super-2 number, since 2×11461512132 = 2627325206122742738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1146151219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 573075606 + 573075607.
It is an arithmetic number, because the mean of its divisors is an integer number (573075607).
Almost surely, 21146151213 is an apocalyptic number.
It is an amenable number.
1146151213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1146151213 is an equidigital number, since it uses as much as digits as its factorization.
1146151213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 720, while the sum is 25.
The square root of 1146151213 is about 33854.8550875646. The cubic root of 1146151213 is about 1046.5194544041.
Adding to 1146151213 its reverse (3121516411), we get a palindrome (4267667624).
The spelling of 1146151213 in words is "one billion, one hundred forty-six million, one hundred fifty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •