Base | Representation |
---|---|
bin | 1010100000100111110010… |
… | …00010011111010111011111 |
3 | 10000211101210110011221120111 |
4 | 11100103321002133113133 |
5 | 11012123014132411111 |
6 | 121053032132030451 |
7 | 4603502441456632 |
oct | 520237102372737 |
9 | 100741713157514 |
10 | 23111102232031 |
11 | 74003aa783090 |
12 | 2713105462427 |
13 | cb84a1793428 |
14 | 59c824897c19 |
15 | 2a128d349a21 |
hex | 1504f909f5df |
23111102232031 has 16 divisors (see below), whose sum is σ = 25247213139456. Its totient is φ = 20980845000000.
The previous prime is 23111102231999. The next prime is 23111102232103. The reversal of 23111102232031 is 13023220111132.
It is a cyclic number.
It is not a de Polignac number, because 23111102232031 - 25 = 23111102231999 is a prime.
It is a super-2 number, since 2×231111022320312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23111102231993 and 23111102232011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23111102232331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 152926456 + ... + 153077506.
It is an arithmetic number, because the mean of its divisors is an integer number (1577950821216).
Almost surely, 223111102232031 is an apocalyptic number.
23111102232031 is a deficient number, since it is larger than the sum of its proper divisors (2136110907425).
23111102232031 is a wasteful number, since it uses less digits than its factorization.
23111102232031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170334.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 23111102232031 its reverse (13023220111132), we get a palindrome (36134322343163).
The spelling of 23111102232031 in words is "twenty-three trillion, one hundred eleven billion, one hundred two million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •