Base | Representation |
---|---|
bin | 101111110001101001100110… |
… | …101000101111101100110111 |
3 | 1000112222021201212210201121001 |
4 | 233301221212220233230313 |
5 | 210020101442133341322 |
6 | 2022515502531504131 |
7 | 62154451153146304 |
oct | 5761514650575467 |
9 | 1015867655721531 |
10 | 210120112012087 |
11 | 60a50491457862 |
12 | 1b696828458047 |
13 | 903231a88c8b4 |
14 | 39c5c20cd60ab |
15 | 1945a8dc11827 |
hex | bf1a66a2fb37 |
210120112012087 has 2 divisors, whose sum is σ = 210120112012088. Its totient is φ = 210120112012086.
The previous prime is 210120112012081. The next prime is 210120112012127. The reversal of 210120112012087 is 780210211021012.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210120112012087 is a prime.
It is a super-2 number, since 2×2101201120120872 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210120112012081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105060056006043 + 105060056006044.
It is an arithmetic number, because the mean of its divisors is an integer number (105060056006044).
Almost surely, 2210120112012087 is an apocalyptic number.
210120112012087 is a deficient number, since it is larger than the sum of its proper divisors (1).
210120112012087 is an equidigital number, since it uses as much as digits as its factorization.
210120112012087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 28.
Adding to 210120112012087 its reverse (780210211021012), we get a palindrome (990330323033099).
The spelling of 210120112012087 in words is "two hundred ten trillion, one hundred twenty billion, one hundred twelve million, twelve thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •