Base | Representation |
---|---|
bin | 10100100000100111… |
… | …10100101000010001 |
3 | 1001102101020021222201 |
4 | 22100103310220101 |
5 | 140022312100001 |
6 | 5020341003201 |
7 | 536602244410 |
oct | 122023645021 |
9 | 31371207881 |
10 | 11011050001 |
11 | 47404a5926 |
12 | 21736b3501 |
13 | 10662c6103 |
14 | 766549477 |
15 | 446a23501 |
hex | 2904f4a11 |
11011050001 has 8 divisors (see below), whose sum is σ = 12611358144. Its totient is φ = 9417567120.
The previous prime is 11011049989. The next prime is 11011050019. The reversal of 11011050001 is 10005011011.
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 11011050001 - 27 = 11011049873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011050001.
It is not an unprimeable number, because it can be changed into a prime (11011050041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1702855 + ... + 1709308.
It is an arithmetic number, because the mean of its divisors is an integer number (1576419768).
Almost surely, 211011050001 is an apocalyptic number.
It is an amenable number.
11011050001 is a deficient number, since it is larger than the sum of its proper divisors (1600308143).
11011050001 is an equidigital number, since it uses as much as digits as its factorization.
11011050001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3412631.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 11011050001 its reverse (10005011011), we get a palindrome (21016061012).
The spelling of 11011050001 in words is "eleven billion, eleven million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •