Base | Representation |
---|---|
bin | 1001001001000001011010… |
… | …11110110100101011100111 |
3 | 2122011122201212221020000002 |
4 | 10210200231132310223213 |
5 | 10113314234230000403 |
6 | 110430211323411515 |
7 | 4143156502565321 |
oct | 444405536645347 |
9 | 78148655836002 |
10 | 20101210000103 |
11 | 644a96a00a121 |
12 | 23078ba683b9b |
13 | b2a6c76a956b |
14 | 4d6c91c92611 |
15 | 24cd2a434188 |
hex | 12482d7b4ae7 |
20101210000103 has 4 divisors (see below), whose sum is σ = 20148956342568. Its totient is φ = 20053463657640.
The previous prime is 20101210000099. The next prime is 20101210000111. The reversal of 20101210000103 is 30100001210102.
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 20101210000103 - 22 = 20101210000099 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 (20101210005103) 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 3 ways as a sum of consecutive naturals, for example, 23873170601 + ... + 23873171442.
It is an arithmetic number, because the mean of its divisors is an integer number (5037239085642).
Almost surely, 220101210000103 is an apocalyptic number.
20101210000103 is a deficient number, since it is larger than the sum of its proper divisors (47746342465).
20101210000103 is an equidigital number, since it uses as much as digits as its factorization.
20101210000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47746342464.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20101210000103 its reverse (30100001210102), we get a palindrome (50201211210205).
The spelling of 20101210000103 in words is "twenty trillion, one hundred one billion, two hundred ten million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •