Base | Representation |
---|---|
bin | 100010001000010… |
… | …1001010011100101 |
3 | 2221210220220112001 |
4 | 1010100221103211 |
5 | 4321133323211 |
6 | 305345525301 |
7 | 40244105566 |
oct | 10420512345 |
9 | 2853826461 |
10 | 1145214181 |
11 | 538497401 |
12 | 27b643831 |
13 | 153351937 |
14 | ac14c16d |
15 | 6a817ac1 |
hex | 444294e5 |
1145214181 has 2 divisors, whose sum is σ = 1145214182. Its totient is φ = 1145214180.
The previous prime is 1145214179. The next prime is 1145214193. The reversal of 1145214181 is 1814125411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1145213281 + 900 = 33841^2 + 30^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145214181 - 21 = 1145214179 is a prime.
It is a super-2 number, since 2×11452141812 = 2623031040727001522, which contains 22 as substring.
Together with 1145214179, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1145814181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572607090 + 572607091.
It is an arithmetic number, because the mean of its divisors is an integer number (572607091).
Almost surely, 21145214181 is an apocalyptic number.
It is an amenable number.
1145214181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145214181 is an equidigital number, since it uses as much as digits as its factorization.
1145214181 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1280, while the sum is 28.
The square root of 1145214181 is about 33841.0132974768. The cubic root of 1145214181 is about 1046.2341838503.
Adding to 1145214181 its reverse (1814125411), we get a palindrome (2959339592).
The spelling of 1145214181 in words is "one billion, one hundred forty-five million, two hundred fourteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.347 sec. • engine limits •