Base | Representation |
---|---|
bin | 10011000011101010… |
… | …01010011010011111 |
3 | 222102000220220100100 |
4 | 21201311022122133 |
5 | 131423200321311 |
6 | 4411123232143 |
7 | 511353165531 |
oct | 114165123237 |
9 | 28360826310 |
10 | 10231260831 |
11 | 4380309770 |
12 | 1b96518653 |
13 | c7089b5bc |
14 | 6d0b61851 |
15 | 3ed33ea56 |
hex | 261d4a69f |
10231260831 has 48 divisors (see below), whose sum is σ = 16588915200. Its totient is φ = 6021812160.
The previous prime is 10231260797. The next prime is 10231260839. The reversal of 10231260831 is 13806213201.
It is a happy number.
10231260831 is a `hidden beast` number, since 1 + 0 + 23 + 1 + 2 + 608 + 31 = 666.
It is not a de Polignac number, because 10231260831 - 217 = 10231129759 is a prime.
It is a super-2 number, since 2×102312608312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10231260795 and 10231260804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231260839) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2191806 + ... + 2196468.
It is an arithmetic number, because the mean of its divisors is an integer number (345602400).
Almost surely, 210231260831 is an apocalyptic number.
10231260831 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10231260831 is a deficient number, since it is larger than the sum of its proper divisors (6357654369).
10231260831 is a wasteful number, since it uses less digits than its factorization.
10231260831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5316 (or 5313 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 10231260831 in words is "ten billion, two hundred thirty-one million, two hundred sixty thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •