Base | Representation |
---|---|
bin | 10010101110000100… |
… | …111100110001111101 |
3 | 1220212211110020022111 |
4 | 102232010330301331 |
5 | 312131200333201 |
6 | 13122313214021 |
7 | 1311051412660 |
oct | 225604746175 |
9 | 56784406274 |
10 | 20100402301 |
11 | 8585175831 |
12 | 3a8b701311 |
13 | 1b8442c595 |
14 | d8977d6d7 |
15 | 7c999eb51 |
hex | 4ae13cc7d |
20100402301 has 4 divisors (see below), whose sum is σ = 22971888352. Its totient is φ = 17228916252.
The previous prime is 20100402299. The next prime is 20100402317. The reversal of 20100402301 is 10320400102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10320400102 = 2 ⋅5160200051.
It is a cyclic number.
It is not a de Polignac number, because 20100402301 - 21 = 20100402299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100402341) 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 3 ways as a sum of consecutive naturals, for example, 1435743015 + ... + 1435743028.
It is an arithmetic number, because the mean of its divisors is an integer number (5742972088).
Almost surely, 220100402301 is an apocalyptic number.
It is an amenable number.
20100402301 is a deficient number, since it is larger than the sum of its proper divisors (2871486051).
20100402301 is an equidigital number, since it uses as much as digits as its factorization.
20100402301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871486050.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20100402301 its reverse (10320400102), we get a palindrome (30420802403).
The spelling of 20100402301 in words is "twenty billion, one hundred million, four hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •