Base | Representation |
---|---|
bin | 10100100011101000… |
… | …01100110101111001 |
3 | 1001111010202220001110 |
4 | 22101310030311321 |
5 | 140100244040001 |
6 | 5023042310533 |
7 | 540330062325 |
oct | 122164146571 |
9 | 31433686043 |
10 | 11036315001 |
11 | 4753791898 |
12 | 2180058449 |
13 | 106b600b0a |
14 | 769a44985 |
15 | 448d643d6 |
hex | 291d0cd79 |
11036315001 has 8 divisors (see below), whose sum is σ = 14755183744. Its totient is φ = 7337494800.
The previous prime is 11036314999. The next prime is 11036315021. The reversal of 11036315001 is 10051363011.
11036315001 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 not a de Polignac number, because 11036315001 - 21 = 11036314999 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11036315021) 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, 5010850 + ... + 5013051.
It is an arithmetic number, because the mean of its divisors is an integer number (1844397968).
Almost surely, 211036315001 is an apocalyptic number.
It is an amenable number.
11036315001 is a deficient number, since it is larger than the sum of its proper divisors (3718868743).
11036315001 is a wasteful number, since it uses less digits than its factorization.
11036315001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10024271.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 11036315001 its reverse (10051363011), we get a palindrome (21087678012).
The spelling of 11036315001 in words is "eleven billion, thirty-six million, three hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •