Base | Representation |
---|---|
bin | 1010100000101001101010… |
… | …10011000100011010010111 |
3 | 10000211111101220112000001011 |
4 | 11100110311103010122113 |
5 | 11012132101440223111 |
6 | 121053320324513051 |
7 | 4603536465605365 |
oct | 520246523043227 |
9 | 100744356460034 |
10 | 23112113211031 |
11 | 7400879415619 |
12 | 2713347b4b787 |
13 | cb8603075960 |
14 | 59c8bcc62635 |
15 | 2a12ebe99021 |
hex | 1505354c4697 |
23112113211031 has 16 divisors (see below), whose sum is σ = 25011852727680. Its totient is φ = 21230040303360.
The previous prime is 23112113210947. The next prime is 23112113211037. The reversal of 23112113211031 is 13011231121132.
It is a cyclic number.
It is not a de Polignac number, because 23112113211031 - 211 = 23112113208983 is a prime.
It is a super-2 number, since 2×231121132110312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23112113210993 and 23112113211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23112113211037) 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, 3122430 + ... + 7481563.
It is an arithmetic number, because the mean of its divisors is an integer number (1563240795480).
Almost surely, 223112113211031 is an apocalyptic number.
23112113211031 is a deficient number, since it is larger than the sum of its proper divisors (1899739516649).
23112113211031 is a wasteful number, since it uses less digits than its factorization.
23112113211031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10604826.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 23112113211031 its reverse (13011231121132), we get a palindrome (36123344332163).
The spelling of 23112113211031 in words is "twenty-three trillion, one hundred twelve billion, one hundred thirteen million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •