Base | Representation |
---|---|
bin | 10010110100000011… |
… | …01101100111010101 |
3 | 222001220120002010220 |
4 | 21122001231213111 |
5 | 131141141124023 |
6 | 4350125104553 |
7 | 505203262011 |
oct | 113201554725 |
9 | 28056502126 |
10 | 10100333013 |
11 | 4313413761 |
12 | 1b5a6b8159 |
13 | c4c719714 |
14 | 6bb5dd541 |
15 | 3e1acb3e3 |
hex | 25a06d9d5 |
10100333013 has 32 divisors (see below), whose sum is σ = 13961590272. Its totient is φ = 6491284800.
The previous prime is 10100332951. The next prime is 10100333017. The reversal of 10100333013 is 31033300101.
10100333013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-10100333013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10100332983 and 10100333001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100333017) 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 31 ways as a sum of consecutive naturals, for example, 5229658 + ... + 5231588.
It is an arithmetic number, because the mean of its divisors is an integer number (436299696).
Almost surely, 210100333013 is an apocalyptic number.
It is an amenable number.
10100333013 is a deficient number, since it is larger than the sum of its proper divisors (3861257259).
10100333013 is a wasteful number, since it uses less digits than its factorization.
10100333013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2545.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 10100333013 its reverse (31033300101), we get a palindrome (41133633114).
The spelling of 10100333013 in words is "ten billion, one hundred million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •