Base | Representation |
---|---|
bin | 10010101000110100… |
… | …000111001010011111 |
3 | 1220122200022010111012 |
4 | 102220310013022133 |
5 | 311441044233203 |
6 | 13105440445435 |
7 | 1305630030404 |
oct | 225064071237 |
9 | 56580263435 |
10 | 20012102303 |
11 | 853a345726 |
12 | 3a6601987b |
13 | 1b6c05436b |
14 | d7bb562ab |
15 | 7c1d5bbd8 |
hex | 4a8d0729f |
20012102303 has 4 divisors (see below), whose sum is σ = 20012400408. Its totient is φ = 20011804200.
The previous prime is 20012102291. The next prime is 20012102323. The reversal of 20012102303 is 30320121002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 30320121002 = 2 ⋅15160060501.
It is a cyclic number.
It is not a de Polignac number, because 20012102303 - 210 = 20012101279 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 (20012102323) 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 3 ways as a sum of consecutive naturals, for example, 4100 + ... + 200102.
It is an arithmetic number, because the mean of its divisors is an integer number (5003100102).
Almost surely, 220012102303 is an apocalyptic number.
20012102303 is a deficient number, since it is larger than the sum of its proper divisors (298105).
20012102303 is a wasteful number, since it uses less digits than its factorization.
20012102303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298104.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20012102303 its reverse (30320121002), we get a palindrome (50332223305).
The spelling of 20012102303 in words is "twenty billion, twelve million, one hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •