Base | Representation |
---|---|
bin | 10100100001101011… |
… | …11101111100000111 |
3 | 1001110000002001111100 |
4 | 22100311331330013 |
5 | 140032110013111 |
6 | 5021300511143 |
7 | 540041314614 |
oct | 122065757407 |
9 | 31400061440 |
10 | 11020001031 |
11 | 4745559976 |
12 | 21766ab4b3 |
13 | 106810b390 |
14 | 7677d950b |
15 | 4476e0756 |
hex | 290d7df07 |
11020001031 has 12 divisors (see below), whose sum is σ = 17142224008. Its totient is φ = 6781539024.
The previous prime is 11020000997. The next prime is 11020001053. The reversal of 11020001031 is 13010002011.
It is not a de Polignac number, because 11020001031 - 213 = 11019992839 is a prime.
It is a super-2 number, since 2×110200010312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020001231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47093905 + ... + 47094138.
Almost surely, 211020001031 is an apocalyptic number.
11020001031 is a deficient number, since it is larger than the sum of its proper divisors (6122222977).
11020001031 is a wasteful number, since it uses less digits than its factorization.
11020001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94188062 (or 94188059 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 11020001031 its reverse (13010002011), we get a palindrome (24030003042).
The spelling of 11020001031 in words is "eleven billion, twenty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •