Base | Representation |
---|---|
bin | 100100001100000… |
… | …1111101011100001 |
3 | 10010121221121100021 |
4 | 1020120033223201 |
5 | 4441331041413 |
6 | 320254553441 |
7 | 42043336435 |
oct | 11030175341 |
9 | 3117847307 |
10 | 1214315233 |
11 | 5734a400a |
12 | 29a808881 |
13 | 164767231 |
14 | b73b89c5 |
15 | 7191718d |
hex | 4860fae1 |
1214315233 has 2 divisors, whose sum is σ = 1214315234. Its totient is φ = 1214315232.
The previous prime is 1214315191. The next prime is 1214315239. The reversal of 1214315233 is 3325134121.
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., 1158245089 + 56070144 = 34033^2 + 7488^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1214315233 is a prime.
It is a super-2 number, since 2×12143152332 = 2949122970191688578, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1214315198 and 1214315207.
It is not a weakly prime, because it can be changed into another prime (1214315239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 607157616 + 607157617.
It is an arithmetic number, because the mean of its divisors is an integer number (607157617).
Almost surely, 21214315233 is an apocalyptic number.
It is an amenable number.
1214315233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214315233 is an equidigital number, since it uses as much as digits as its factorization.
1214315233 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2160, while the sum is 25.
The square root of 1214315233 is about 34847.0261715401. The cubic root of 1214315233 is about 1066.8674892176.
Adding to 1214315233 its reverse (3325134121), we get a palindrome (4539449354).
The spelling of 1214315233 in words is "one billion, two hundred fourteen million, three hundred fifteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •