Base | Representation |
---|---|
bin | 101111110001100000010001… |
… | …111111111111111100101101 |
3 | 1000112221022220021102000100121 |
4 | 233301200101333333330231 |
5 | 210014420442120004442 |
6 | 2022511125352524541 |
7 | 62153645125323265 |
oct | 5761402177777455 |
9 | 1015838807360317 |
10 | 210110102109997 |
11 | 60a4721509a201 |
12 | 1b6948b40b0751 |
13 | 90313b3b162cb |
14 | 39c55517167a5 |
15 | 19456a5049967 |
hex | bf1811ffff2d |
210110102109997 has 2 divisors, whose sum is σ = 210110102109998. Its totient is φ = 210110102109996.
The previous prime is 210110102109967. The next prime is 210110102110019. The reversal of 210110102109997 is 799901201011012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 167804716970916 + 42305385139081 = 12953946^2 + 6504259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210110102109997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210110102109967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105055051054998 + 105055051054999.
It is an arithmetic number, because the mean of its divisors is an integer number (105055051054999).
Almost surely, 2210110102109997 is an apocalyptic number.
It is an amenable number.
210110102109997 is a deficient number, since it is larger than the sum of its proper divisors (1).
210110102109997 is an equidigital number, since it uses as much as digits as its factorization.
210110102109997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 43.
The spelling of 210110102109997 in words is "two hundred ten trillion, one hundred ten billion, one hundred two million, one hundred nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •