Base | Representation |
---|---|
bin | 111101100001001… |
… | …001100010101011 |
3 | 2122221002010001100 |
4 | 331201021202223 |
5 | 4103204200021 |
6 | 250225252443 |
7 | 34401463635 |
oct | 7541114253 |
9 | 2587063040 |
10 | 1032100011 |
11 | 48a659018 |
12 | 249794123 |
13 | 135a98c87 |
14 | 9b105a55 |
15 | 60922626 |
hex | 3d8498ab |
1032100011 has 12 divisors (see below), whose sum is σ = 1527172920. Its totient is φ = 671284320.
The previous prime is 1032100009. The next prime is 1032100021. The reversal of 1032100011 is 1100012301.
1032100011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1032100011 - 21 = 1032100009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1032099966 and 1032100002.
It is not an unprimeable number, because it can be changed into a prime (1032100021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1398141 + ... + 1398878.
It is an arithmetic number, because the mean of its divisors is an integer number (127264410).
Almost surely, 21032100011 is an apocalyptic number.
1032100011 is a deficient number, since it is larger than the sum of its proper divisors (495072909).
1032100011 is a wasteful number, since it uses less digits than its factorization.
1032100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2797066 (or 2797063 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1032100011 is about 32126.3133739307. The cubic root of 1032100011 is about 1010.5875126389.
Adding to 1032100011 its reverse (1100012301), we get a palindrome (2132112312).
The spelling of 1032100011 in words is "one billion, thirty-two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •