Base | Representation |
---|---|
bin | 100100001011110… |
… | …0010011111110001 |
3 | 10010121121012110202 |
4 | 1020113202133301 |
5 | 4441304131121 |
6 | 320251004545 |
7 | 42041636036 |
oct | 11027423761 |
9 | 3117535422 |
10 | 1214130161 |
11 | 573387a62 |
12 | 29a739755 |
13 | 164700c1a |
14 | b736b38d |
15 | 718cc40b |
hex | 485e27f1 |
1214130161 has 2 divisors, whose sum is σ = 1214130162. Its totient is φ = 1214130160.
The previous prime is 1214130131. The next prime is 1214130163. The reversal of 1214130161 is 1610314121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1040707600 + 173422561 = 32260^2 + 13169^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1214130161 is a prime.
It is a super-2 number, since 2×12141301612 = 2948224095699771842, which contains 22 as substring.
Together with 1214130163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1214130163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 607065080 + 607065081.
It is an arithmetic number, because the mean of its divisors is an integer number (607065081).
Almost surely, 21214130161 is an apocalyptic number.
It is an amenable number.
1214130161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214130161 is an equidigital number, since it uses as much as digits as its factorization.
1214130161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 1214130161 is about 34844.3705783302. The cubic root of 1214130161 is about 1066.8132865618.
Adding to 1214130161 its reverse (1610314121), we get a palindrome (2824444282).
The spelling of 1214130161 in words is "one billion, two hundred fourteen million, one hundred thirty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •