Base | Representation |
---|---|
bin | 1101011100111100111… |
… | …1110101100101000111 |
3 | 211002112110210202220200 |
4 | 3113033033311211013 |
5 | 12241303214131043 |
6 | 254100503501543 |
7 | 22461062103666 |
oct | 3271717654507 |
9 | 732473722820 |
10 | 231110302023 |
11 | 8a016816607 |
12 | 3895a4578b3 |
13 | 18a41731103 |
14 | b285b8addd |
15 | 60297bb7d3 |
hex | 35cf3f5947 |
231110302023 has 48 divisors (see below), whose sum is σ = 369295620096. Its totient is φ = 138765908160.
The previous prime is 231110301997. The next prime is 231110302037. The reversal of 231110302023 is 320203011132.
231110302023 is a `hidden beast` number, since 231 + 110 + 302 + 0 + 23 = 666.
It is not a de Polignac number, because 231110302023 - 26 = 231110301959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231110301987 and 231110302005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231110302523) 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, 249265 + ... + 724122.
It is an arithmetic number, because the mean of its divisors is an integer number (7693658752).
Almost surely, 2231110302023 is an apocalyptic number.
231110302023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
231110302023 is a deficient number, since it is larger than the sum of its proper divisors (138185318073).
231110302023 is a wasteful number, since it uses less digits than its factorization.
231110302023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 973484 (or 973481 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 231110302023 its reverse (320203011132), we get a palindrome (551313313155).
The spelling of 231110302023 in words is "two hundred thirty-one billion, one hundred ten million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •