Base | Representation |
---|---|
bin | 101101111101000101101100… |
… | …110101011111100101110111 |
3 | 222111121112111111211112122021 |
4 | 231331011230311133211313 |
5 | 202442332442103311411 |
6 | 1553504033222414011 |
7 | 60366654511420132 |
oct | 5575055465374567 |
9 | 874545444745567 |
10 | 202110102010231 |
11 | 5944245a649018 |
12 | 1a802360291307 |
13 | 88a0b931b891c |
14 | 37ca27704d219 |
15 | 18575330b4a71 |
hex | b7d16cd5f977 |
202110102010231 has 2 divisors, whose sum is σ = 202110102010232. Its totient is φ = 202110102010230.
The previous prime is 202110102010207. The next prime is 202110102010241. The reversal of 202110102010231 is 132010201011202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202110102010231 - 217 = 202110101879159 is a prime.
It is a super-2 number, since 2×2021101020102312 (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 (202110102010241) 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, 101055051005115 + 101055051005116.
It is an arithmetic number, because the mean of its divisors is an integer number (101055051005116).
Almost surely, 2202110102010231 is an apocalyptic number.
202110102010231 is a deficient number, since it is larger than the sum of its proper divisors (1).
202110102010231 is an equidigital number, since it uses as much as digits as its factorization.
202110102010231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 202110102010231 its reverse (132010201011202), we get a palindrome (334120303021433).
The spelling of 202110102010231 in words is "two hundred two trillion, one hundred ten billion, one hundred two million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •