Base | Representation |
---|---|
bin | 10100100000101111… |
… | …10100111110100001 |
3 | 1001102110012122022121 |
4 | 22100113310332201 |
5 | 140023044200001 |
6 | 5020415304241 |
7 | 536614206550 |
oct | 122027647641 |
9 | 31373178277 |
10 | 11012100001 |
11 | 47410527a1 |
12 | 2173b1b081 |
13 | 10665a3006 |
14 | 76673dd97 |
15 | 446b7e6a1 |
hex | 2905f4fa1 |
11012100001 has 8 divisors (see below), whose sum is σ = 12637480064. Its totient is φ = 9399775680.
The previous prime is 11012099981. The next prime is 11012100041. The reversal of 11012100001 is 10000121011.
11012100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11012100001 - 213 = 11012091809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012100041) 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, 3262125 + ... + 3265498.
It is an arithmetic number, because the mean of its divisors is an integer number (1579685008).
Almost surely, 211012100001 is an apocalyptic number.
It is an amenable number.
11012100001 is a deficient number, since it is larger than the sum of its proper divisors (1625380063).
11012100001 is an equidigital number, since it uses as much as digits as its factorization.
11012100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6527871.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11012100001 its reverse (10000121011), we get a palindrome (21012221012).
The spelling of 11012100001 in words is "eleven billion, twelve million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •