Base | Representation |
---|---|
bin | 10010101110001000… |
… | …000001111111110111 |
3 | 1220212212222021102002 |
4 | 102232020001333313 |
5 | 312131402210403 |
6 | 13122342405515 |
7 | 1311061316042 |
oct | 225610017767 |
9 | 56785867362 |
10 | 20101210103 |
11 | 8585677737 |
12 | 3a8ba3089b |
13 | 1b84653180 |
14 | d8990dc59 |
15 | 7c9aae188 |
hex | 4ae201ff7 |
20101210103 has 8 divisors (see below), whose sum is σ = 21650683488. Its totient is φ = 18552197664.
The previous prime is 20101210099. The next prime is 20101210121. The reversal of 20101210103 is 30101210102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20101210103 - 22 = 20101210099 is a prime.
It is a super-4 number, since 4×201012101034 (a number of 42 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101200103) 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 7 ways as a sum of consecutive naturals, for example, 21851 + ... + 201692.
It is an arithmetic number, because the mean of its divisors is an integer number (2706335436).
Almost surely, 220101210103 is an apocalyptic number.
20101210103 is a deficient number, since it is larger than the sum of its proper divisors (1549473385).
20101210103 is a wasteful number, since it uses less digits than its factorization.
20101210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230473.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20101210103 its reverse (30101210102), we get a palindrome (50202420205).
Subtracting 20101210103 from its reverse (30101210102), we obtain a palindrome (9999999999).
The spelling of 20101210103 in words is "twenty billion, one hundred one million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •