Base | Representation |
---|---|
bin | 10011000011101010… |
… | …11011011000000111 |
3 | 222102001001102122200 |
4 | 21201311123120013 |
5 | 131423210032221 |
6 | 4411124525543 |
7 | 511353605226 |
oct | 114165333007 |
9 | 28361042580 |
10 | 10231330311 |
11 | 4380356994 |
12 | 1b965508b3 |
13 | c708c4107 |
14 | 6d0b7ccbd |
15 | 3ed355426 |
hex | 261d5b607 |
10231330311 has 24 divisors (see below), whose sum is σ = 15581782320. Its totient is φ = 6451353216.
The previous prime is 10231330271. The next prime is 10231330379. The reversal of 10231330311 is 11303313201.
It is a happy number.
10231330311 is a `hidden beast` number, since 1 + 0 + 23 + 1 + 330 + 311 = 666.
10231330311 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 10231330311 - 215 = 10231297543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231332311) 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 23 ways as a sum of consecutive naturals, for example, 57021 + ... + 153993.
It is an arithmetic number, because the mean of its divisors is an integer number (649240930).
Almost surely, 210231330311 is an apocalyptic number.
10231330311 is a deficient number, since it is larger than the sum of its proper divisors (5350452009).
10231330311 is a wasteful number, since it uses less digits than its factorization.
10231330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97615 (or 97612 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 10231330311 its reverse (11303313201), we get a palindrome (21534643512).
The spelling of 10231330311 in words is "ten billion, two hundred thirty-one million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •