Base | Representation |
---|---|
bin | 1001001100110101100111… |
… | …11101111100011011100011 |
3 | 2122122012010211201202010212 |
4 | 10212122303331330123203 |
5 | 10122441240210333011 |
6 | 111010333005444335 |
7 | 4155510430501601 |
oct | 446326375743343 |
9 | 78565124652125 |
10 | 20232315324131 |
11 | 64a05275aa589 |
12 | 23291a95706ab |
13 | b39b8c577181 |
14 | 4dd36c084871 |
15 | 25145033108b |
hex | 1266b3f7c6e3 |
20232315324131 has 4 divisors (see below), whose sum is σ = 20237464810200. Its totient is φ = 20227165838064.
The previous prime is 20232315324121. The next prime is 20232315324139. The reversal of 20232315324131 is 13142351323202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20232315324131 - 238 = 19957437417187 is a prime.
It is a super-2 number, since 2×202323153241312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20232315324139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2574737141 + ... + 2574744998.
It is an arithmetic number, because the mean of its divisors is an integer number (5059366202550).
Almost surely, 220232315324131 is an apocalyptic number.
20232315324131 is a deficient number, since it is larger than the sum of its proper divisors (5149486069).
20232315324131 is an equidigital number, since it uses as much as digits as its factorization.
20232315324131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5149486068.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 20232315324131 its reverse (13142351323202), we get a palindrome (33374666647333).
The spelling of 20232315324131 in words is "twenty trillion, two hundred thirty-two billion, three hundred fifteen million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •