Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1010100010110101011 |
3 | 100202021122001202200001 |
4 | 1132333233110112223 |
5 | 3132344240201303 |
6 | 114505245323431 |
7 | 10240453021612 |
oct | 1367757242653 |
9 | 322248052601 |
10 | 102001100203 |
11 | 3a292a64322 |
12 | 17927b66577 |
13 | 98072807c2 |
14 | 4d18b24879 |
15 | 29bec6831d |
hex | 17bfbd45ab |
102001100203 has 4 divisors (see below), whose sum is σ = 102022350808. Its totient is φ = 101979849600.
The previous prime is 102001100197. The next prime is 102001100209. The reversal of 102001100203 is 302001100201.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (102001100197) and next prime (102001100209).
It is a cyclic number.
It is not a de Polignac number, because 102001100203 - 217 = 102000969131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102001100203.
It is not an unprimeable number, because it can be changed into a prime (102001100209) 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, 10618101 + ... + 10627702.
It is an arithmetic number, because the mean of its divisors is an integer number (25505587702).
Almost surely, 2102001100203 is an apocalyptic number.
102001100203 is a deficient number, since it is larger than the sum of its proper divisors (21250605).
102001100203 is an equidigital number, since it uses as much as digits as its factorization.
102001100203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21250604.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 102001100203 its reverse (302001100201), we get a palindrome (404002200404).
The spelling of 102001100203 in words is "one hundred two billion, one million, one hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •