Base | Representation |
---|---|
bin | 1010011110000100000101… |
… | …11011011000001010110011 |
3 | 10000111222221212201120010020 |
4 | 11033002002323120022303 |
5 | 11004203024123411011 |
6 | 120544415530534523 |
7 | 4564241613116430 |
oct | 517020273301263 |
9 | 100458855646106 |
10 | 23023221310131 |
11 | 7377103240809 |
12 | 26ba07a297443 |
13 | cb01079ab923 |
14 | 5984891b0b87 |
15 | 29dd48053006 |
hex | 14f082ed82b3 |
23023221310131 has 32 divisors (see below), whose sum is σ = 35099560032768. Its totient is φ = 13149918950400.
The previous prime is 23023221310127. The next prime is 23023221310151. The reversal of 23023221310131 is 13101312232032.
It is not a de Polignac number, because 23023221310131 - 22 = 23023221310127 is a prime.
It is a super-2 number, since 2×230232213101312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23023221310151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1065829731 + ... + 1065851331.
It is an arithmetic number, because the mean of its divisors is an integer number (1096861251024).
Almost surely, 223023221310131 is an apocalyptic number.
23023221310131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23023221310131 is a deficient number, since it is larger than the sum of its proper divisors (12076338722637).
23023221310131 is a wasteful number, since it uses less digits than its factorization.
23023221310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43211.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 23023221310131 its reverse (13101312232032), we get a palindrome (36124533542163).
The spelling of 23023221310131 in words is "twenty-three trillion, twenty-three billion, two hundred twenty-one million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •