Base | Representation |
---|---|
bin | 111111001011110… |
… | …0101010000110001 |
3 | 12110202100210202022 |
4 | 1332113211100301 |
5 | 13320222024103 |
6 | 550213201225 |
7 | 103352435036 |
oct | 17627452061 |
9 | 5422323668 |
10 | 2120111153 |
11 | 998824986 |
12 | 4b2030215 |
13 | 27a30ca54 |
14 | 16180338d |
15 | c61db138 |
hex | 7e5e5431 |
2120111153 has 2 divisors, whose sum is σ = 2120111154. Its totient is φ = 2120111152.
The previous prime is 2120111093. The next prime is 2120111177. The reversal of 2120111153 is 3511110212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1076627344 + 1043483809 = 32812^2 + 32303^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120111153 - 210 = 2120110129 is a prime.
It is a super-3 number, since 3×21201111533 (a number of 29 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (2120111183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060055576 + 1060055577.
It is an arithmetic number, because the mean of its divisors is an integer number (1060055577).
Almost surely, 22120111153 is an apocalyptic number.
It is an amenable number.
2120111153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120111153 is an equidigital number, since it uses as much as digits as its factorization.
2120111153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 2120111153 is about 46044.6647615117. The cubic root of 2120111153 is about 1284.6541086822.
Adding to 2120111153 its reverse (3511110212), we get a palindrome (5631221365).
The spelling of 2120111153 in words is "two billion, one hundred twenty million, one hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •