Base | Representation |
---|---|
bin | 101111110001100000011000… |
… | …011011100100010101001011 |
3 | 1000112221100011210102101220011 |
4 | 233301200120123210111023 |
5 | 210014421202230001303 |
6 | 2022511144205212351 |
7 | 62153650605350062 |
oct | 5761403033442513 |
9 | 1015840153371804 |
10 | 210110210000203 |
11 | 60a4726aa8a767 |
12 | 1b6949242610b7 |
13 | 9031400290276 |
14 | 39c5561b9d1d9 |
15 | 19456ae75c16d |
hex | bf18186e454b |
210110210000203 has 8 divisors (see below), whose sum is σ = 222476013437472. Its totient is φ = 197745115376256.
The previous prime is 210110210000183. The next prime is 210110210000231. The reversal of 210110210000203 is 302000012011012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-210110210000203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210110210000233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176592975 + ... + 177778792.
It is an arithmetic number, because the mean of its divisors is an integer number (27809501679684).
Almost surely, 2210110210000203 is an apocalyptic number.
210110210000203 is a deficient number, since it is larger than the sum of its proper divisors (12365803437269).
210110210000203 is a wasteful number, since it uses less digits than its factorization.
210110210000203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354406661.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 210110210000203 its reverse (302000012011012), we get a palindrome (512110222011215).
The spelling of 210110210000203 in words is "two hundred ten trillion, one hundred ten billion, two hundred ten million, two hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •