Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00101010000011001 |
3 | 1001110000010120121100 |
4 | 22100312011100121 |
5 | 140032111443001 |
6 | 5021301302013 |
7 | 540041501160 |
oct | 122066052031 |
9 | 31400116540 |
10 | 11020031001 |
11 | 474557a441 |
12 | 2176704909 |
13 | 106811bc05 |
14 | 7678063d7 |
15 | 4476e9586 |
hex | 290d85419 |
11020031001 has 96 divisors (see below), whose sum is σ = 19552665600. Its totient is φ = 5845633920.
The previous prime is 11020030993. The next prime is 11020031039. The reversal of 11020031001 is 10013002011.
It is not a de Polignac number, because 11020031001 - 23 = 11020030993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11020031081) 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 95 ways as a sum of consecutive naturals, for example, 10137480 + ... + 10138566.
It is an arithmetic number, because the mean of its divisors is an integer number (203673600).
Almost surely, 211020031001 is an apocalyptic number.
It is an amenable number.
11020031001 is a deficient number, since it is larger than the sum of its proper divisors (8532634599).
11020031001 is a wasteful number, since it uses less digits than its factorization.
11020031001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339 (or 1336 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 11020031001 its reverse (10013002011), we get a palindrome (21033033012).
The spelling of 11020031001 in words is "eleven billion, twenty million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •