Base | Representation |
---|---|
bin | 10010101110001000… |
… | …011100110110100101 |
3 | 1220212220011212022002 |
4 | 102232020130312211 |
5 | 312131414220401 |
6 | 13122345015045 |
7 | 1311062254532 |
oct | 225610346645 |
9 | 56786155262 |
10 | 20101320101 |
11 | 8585742345 |
12 | 3a8ba84485 |
13 | 1b84691265 |
14 | d8993bd89 |
15 | 7c9ad1a6b |
hex | 4ae21cda5 |
20101320101 has 8 divisors (see below), whose sum is σ = 21104836320. Its totient is φ = 19118495088.
The previous prime is 20101320091. The next prime is 20101320121. The reversal of 20101320101 is 10102310102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101320101 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 (20101320121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5170811 + ... + 5174696.
It is an arithmetic number, because the mean of its divisors is an integer number (2638104540).
Almost surely, 220101320101 is an apocalyptic number.
It is an amenable number.
20101320101 is a deficient number, since it is larger than the sum of its proper divisors (1003516219).
20101320101 is a wasteful number, since it uses less digits than its factorization.
20101320101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10345603.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20101320101 its reverse (10102310102), we get a palindrome (30203630203).
Subtracting from 20101320101 its reverse (10102310102), we obtain a palindrome (9999009999).
The spelling of 20101320101 in words is "twenty billion, one hundred one million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •