Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010111001111010001 |
3 | 1220220111220111221122 |
4 | 102232222113033101 |
5 | 312141203210001 |
6 | 13123303332025 |
7 | 1311230651600 |
oct | 225652271721 |
9 | 56814814848 |
10 | 20110210001 |
11 | 858a764472 |
12 | 3a92a51015 |
13 | 1b8648475b |
14 | d8abb3a37 |
15 | 7ca78ab1b |
hex | 4aea973d1 |
20110210001 has 12 divisors (see below), whose sum is σ = 23426545140. Its totient is φ = 17212980960.
The previous prime is 20110209991. The next prime is 20110210009. The reversal of 20110210001 is 10001201102.
It can be written as a sum of positive squares in 2 ways, for example, as 11320960000 + 8789250001 = 106400^2 + 93751^2 .
It is not a de Polignac number, because 20110210001 - 226 = 20043101137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110210009) 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 11 ways as a sum of consecutive naturals, for example, 254690 + ... + 324171.
It is an arithmetic number, because the mean of its divisors is an integer number (1952212095).
Almost surely, 220110210001 is an apocalyptic number.
It is an amenable number.
20110210001 is a deficient number, since it is larger than the sum of its proper divisors (3316335139).
20110210001 is an equidigital number, since it uses as much as digits as its factorization.
20110210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579584 (or 579577 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20110210001 its reverse (10001201102), we get a palindrome (30111411103).
It can be divided in two parts, 201102 and 10001, that multiplied together give a palindrome (2011221102).
The spelling of 20110210001 in words is "twenty billion, one hundred ten million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •