Base | Representation |
---|---|
bin | 10010101101010000… |
… | …10000111000111111 |
3 | 221220221022000212022 |
4 | 21112220100320333 |
5 | 131032043030421 |
6 | 4340331230355 |
7 | 503611616543 |
oct | 112650207077 |
9 | 27827260768 |
10 | 10043330111 |
11 | 429421a621 |
12 | 1b435a83bb |
13 | c4097b9a9 |
14 | 6b3c01a23 |
15 | 3dbabb7ab |
hex | 256a10e3f |
10043330111 has 16 divisors (see below), whose sum is σ = 10345569696. Its totient is φ = 9744000000.
The previous prime is 10043330071. The next prime is 10043330113. The reversal of 10043330111 is 11103334001.
10043330111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10043330111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10043330111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10043330113) 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 15 ways as a sum of consecutive naturals, for example, 6920936 + ... + 6922386.
It is an arithmetic number, because the mean of its divisors is an integer number (646598106).
Almost surely, 210043330111 is an apocalyptic number.
10043330111 is a deficient number, since it is larger than the sum of its proper divisors (302239585).
10043330111 is a wasteful number, since it uses less digits than its factorization.
10043330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2314.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10043330111 its reverse (11103334001), we get a palindrome (21146664112).
The spelling of 10043330111 in words is "ten billion, forty-three million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •