Base | Representation |
---|---|
bin | 10100111000011101… |
… | …01001011011100001 |
3 | 1001221022111211021000 |
4 | 22130032221123201 |
5 | 140430010120001 |
6 | 5052243022213 |
7 | 544551045336 |
oct | 123416513341 |
9 | 31838454230 |
10 | 11211020001 |
11 | 4833368295 |
12 | 220a66a969 |
13 | 109886c85c |
14 | 784d2098d |
15 | 459373a86 |
hex | 29c3a96e1 |
11211020001 has 8 divisors (see below), whose sum is σ = 16608918560. Its totient is φ = 7474013316.
The previous prime is 11211019991. The next prime is 11211020003. The reversal of 11211020001 is 10002011211.
It is a happy number.
11211020001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11211020001 - 25 = 11211019969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11211020003) 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, 207611455 + ... + 207611508.
It is an arithmetic number, because the mean of its divisors is an integer number (2076114820).
Almost surely, 211211020001 is an apocalyptic number.
It is an amenable number.
11211020001 is a deficient number, since it is larger than the sum of its proper divisors (5397898559).
11211020001 is an equidigital number, since it uses as much as digits as its factorization.
11211020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415222972 (or 415222966 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11211020001 its reverse (10002011211), we get a palindrome (21213031212).
The spelling of 11211020001 in words is "eleven billion, two hundred eleven million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •