Base | Representation |
---|---|
bin | 10010101000001101… |
… | …111101101011110001 |
3 | 1220121222111001122122 |
4 | 102220031331223301 |
5 | 311431014231001 |
6 | 13104442244025 |
7 | 1305446030120 |
oct | 225015755361 |
9 | 56558431578 |
10 | 20002102001 |
11 | 8534735312 |
12 | 3a627b6615 |
13 | 1b69c6261b |
14 | d7a6b1ab7 |
15 | 7c1033b1b |
hex | 4a837daf1 |
20002102001 has 4 divisors (see below), whose sum is σ = 22859545152. Its totient is φ = 17144658852.
The previous prime is 20002101997. The next prime is 20002102067. The reversal of 20002102001 is 10020120002.
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.
It is a cyclic number.
It is not a de Polignac number, because 20002102001 - 22 = 20002101997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20002102001.
It is not an unprimeable number, because it can be changed into a prime (20002102501) 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, 1428721565 + ... + 1428721578.
It is an arithmetic number, because the mean of its divisors is an integer number (5714886288).
Almost surely, 220002102001 is an apocalyptic number.
It is an amenable number.
20002102001 is a deficient number, since it is larger than the sum of its proper divisors (2857443151).
20002102001 is an equidigital number, since it uses as much as digits as its factorization.
20002102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2857443150.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20002102001 its reverse (10020120002), we get a palindrome (30022222003).
The spelling of 20002102001 in words is "twenty billion, two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •