Base | Representation |
---|---|
bin | 1100001111000100010… |
… | …1100111000100100111 |
3 | 202002120102102110100221 |
4 | 3003301011213010213 |
5 | 11420444010210043 |
6 | 240322132145211 |
7 | 21121013543002 |
oct | 3036105470447 |
9 | 662512373327 |
10 | 210203210023 |
11 | 81168260984 |
12 | 348a4768207 |
13 | 16a8c148a61 |
14 | a261220539 |
15 | 57040c28ed |
hex | 30f1167127 |
210203210023 has 4 divisors (see below), whose sum is σ = 219342480048. Its totient is φ = 201063940000.
The previous prime is 210203210003. The next prime is 210203210039. The reversal of 210203210023 is 320012302012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210203210023 - 217 = 210203078951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210203209979 and 210203210006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210203210003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4569634978 + ... + 4569635023.
It is an arithmetic number, because the mean of its divisors is an integer number (54835620012).
Almost surely, 2210203210023 is an apocalyptic number.
210203210023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
210203210023 is a deficient number, since it is larger than the sum of its proper divisors (9139270025).
210203210023 is an equidigital number, since it uses as much as digits as its factorization.
210203210023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9139270024.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 210203210023 its reverse (320012302012), we get a palindrome (530215512035).
The spelling of 210203210023 in words is "two hundred ten billion, two hundred three million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •