Base | Representation |
---|---|
bin | 10010101001001010… |
… | …10101111101011011 |
3 | 221211112201101112111 |
4 | 21110211111331123 |
5 | 130444301310021 |
6 | 4333103453151 |
7 | 503014116130 |
oct | 112445257533 |
9 | 27745641474 |
10 | 10009010011 |
11 | 4276909400 |
12 | 1b33bb71b7 |
13 | c36823540 |
14 | 6ad42a587 |
15 | 3d8a8c8e1 |
hex | 254955f5b |
10009010011 has 48 divisors (see below), whose sum is σ = 13582351552. Its totient is φ = 7177040640.
The previous prime is 10009009993. The next prime is 10009010023. The reversal of 10009010011 is 11001090001.
It is not a de Polignac number, because 10009010011 - 27 = 10009009883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 10009009973 and 10009010000.
It is not an unprimeable number, because it can be changed into a prime (10009010041) 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 47 ways as a sum of consecutive naturals, for example, 4105885 + ... + 4108321.
Almost surely, 210009010011 is an apocalyptic number.
10009010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10009010011 is a deficient number, since it is larger than the sum of its proper divisors (3573341541).
10009010011 is a wasteful number, since it uses less digits than its factorization.
10009010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852 (or 2841 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 13.
The spelling of 10009010011 in words is "ten billion, nine million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •