Base | Representation |
---|---|
bin | 10010110101001110… |
… | …00000101001111011 |
3 | 222002120221211002210 |
4 | 21122213000221323 |
5 | 131201142012311 |
6 | 4351114430203 |
7 | 505352343216 |
oct | 113247005173 |
9 | 28076854083 |
10 | 10110110331 |
11 | 4318991592 |
12 | 1b61a32363 |
13 | c51760b09 |
14 | 6bca2677d |
15 | 3e28ad3a6 |
hex | 25a9c0a7b |
10110110331 has 8 divisors (see below), whose sum is σ = 13480850944. Its totient is φ = 6739721640.
The previous prime is 10110110317. The next prime is 10110110359. The reversal of 10110110331 is 13301101101.
10110110331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10110110331 - 27 = 10110110203 is a prime.
It is a super-2 number, since 2×101101103312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110114331) 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 7 ways as a sum of consecutive naturals, for example, 11431 + ... + 142656.
It is an arithmetic number, because the mean of its divisors is an integer number (1685106368).
Almost surely, 210110110331 is an apocalyptic number.
10110110331 is a deficient number, since it is larger than the sum of its proper divisors (3370740613).
10110110331 is a wasteful number, since it uses less digits than its factorization.
10110110331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175961.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 10110110331 its reverse (13301101101), we get a palindrome (23411211432).
The spelling of 10110110331 in words is "ten billion, one hundred ten million, one hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •