Base | Representation |
---|---|
bin | 1010100001001101010000… |
… | …10101101000101101100111 |
3 | 10000220022201201012121211001 |
4 | 11100212220111220231213 |
5 | 11012440221110224111 |
6 | 121110200500454131 |
7 | 4605114162346606 |
oct | 520465025505547 |
9 | 100808651177731 |
10 | 23131223133031 |
11 | 7408995479892 |
12 | 2716b9b9aa347 |
13 | cba35a21c100 |
14 | 59d7b2c51a3d |
15 | 2a1a699e81c1 |
hex | 1509a8568b67 |
23131223133031 has 12 divisors (see below), whose sum is σ = 25047555735312. Its totient is φ = 21351781828416.
The previous prime is 23131223133019. The next prime is 23131223133037. The reversal of 23131223133031 is 13033132213132.
It is a happy number.
It is not a de Polignac number, because 23131223133031 - 25 = 23131223132999 is a prime.
It is a super-2 number, since 2×231312231330312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23131223133037) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54532395 + ... + 54954931.
It is an arithmetic number, because the mean of its divisors is an integer number (2087296311276).
Almost surely, 223131223133031 is an apocalyptic number.
23131223133031 is a deficient number, since it is larger than the sum of its proper divisors (1916332602281).
23131223133031 is a wasteful number, since it uses less digits than its factorization.
23131223133031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746490 (or 746477 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 23131223133031 its reverse (13033132213132), we get a palindrome (36164355346163).
The spelling of 23131223133031 in words is "twenty-three trillion, one hundred thirty-one billion, two hundred twenty-three million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •