Base | Representation |
---|---|
bin | 1001001100001100000011… |
… | …11000100000100111001111 |
3 | 2122120001112122220002122002 |
4 | 10212012001320200213033 |
5 | 10122110040022432231 |
6 | 110552202415142515 |
7 | 4154060434212212 |
oct | 446060170404717 |
9 | 78501478802562 |
10 | 20210000202191 |
11 | 6492016271148 |
12 | 2324a00214a3b |
13 | b37a443613c7 |
14 | 4dc252515779 |
15 | 250a962080cb |
hex | 126181e209cf |
20210000202191 has 4 divisors (see below), whose sum is σ = 20231206918992. Its totient is φ = 20188793485392.
The previous prime is 20210000202163. The next prime is 20210000202193. The reversal of 20210000202191 is 19120200001202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20210000202191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20210000202193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10603356971 + ... + 10603358876.
It is an arithmetic number, because the mean of its divisors is an integer number (5057801729748).
Almost surely, 220210000202191 is an apocalyptic number.
20210000202191 is a deficient number, since it is larger than the sum of its proper divisors (21206716801).
20210000202191 is an equidigital number, since it uses as much as digits as its factorization.
20210000202191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21206716800.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 20210000202191 its reverse (19120200001202), we get a palindrome (39330200203393).
The spelling of 20210000202191 in words is "twenty trillion, two hundred ten billion, two hundred two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •