Base | Representation |
---|---|
bin | 100100000110100… |
… | …1011011010001001 |
3 | 10010102111012210212 |
4 | 1020031023122021 |
5 | 4440110223103 |
6 | 320112450505 |
7 | 42006564455 |
oct | 11015133211 |
9 | 3112435725 |
10 | 1211414153 |
11 | 5718a2424 |
12 | 299849a35 |
13 | 163c8c911 |
14 | b6c61665 |
15 | 715427d8 |
hex | 4834b689 |
1211414153 has 2 divisors, whose sum is σ = 1211414154. Its totient is φ = 1211414152.
The previous prime is 1211414111. The next prime is 1211414177. The reversal of 1211414153 is 3514141121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 740003209 + 471410944 = 27203^2 + 21712^2 .
It is a cyclic number.
It is not a de Polignac number, because 1211414153 - 220 = 1210365577 is a prime.
It is a super-3 number, since 3×12114141533 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1211414053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605707076 + 605707077.
It is an arithmetic number, because the mean of its divisors is an integer number (605707077).
Almost surely, 21211414153 is an apocalyptic number.
It is an amenable number.
1211414153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211414153 is an equidigital number, since it uses as much as digits as its factorization.
1211414153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 480, while the sum is 23.
The square root of 1211414153 is about 34805.3753463456. The cubic root of 1211414153 is about 1066.0172058912.
Adding to 1211414153 its reverse (3514141121), we get a palindrome (4725555274).
The spelling of 1211414153 in words is "one billion, two hundred eleven million, four hundred fourteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •