Base | Representation |
---|---|
bin | 1001001100110011110100… |
… | …00101111100010100100111 |
3 | 2122122002122011122202111020 |
4 | 10212121322011330110213 |
5 | 10122432243122423221 |
6 | 111010052402142223 |
7 | 4155444400340034 |
oct | 446317205742447 |
9 | 78562564582436 |
10 | 20231344342311 |
11 | 64a00794a6573 |
12 | 2328b78351973 |
13 | b39a6635a10b |
14 | 4dd2b912c38b |
15 | 2513e4e82ac6 |
hex | 12667a17c527 |
20231344342311 has 8 divisors (see below), whose sum is σ = 28147957345920. Its totient is φ = 12901147116792.
The previous prime is 20231344342289. The next prime is 20231344342387. The reversal of 20231344342311 is 11324344313202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20231344342311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20231344342211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146603944441 + ... + 146603944578.
It is an arithmetic number, because the mean of its divisors is an integer number (3518494668240).
Almost surely, 220231344342311 is an apocalyptic number.
20231344342311 is a deficient number, since it is larger than the sum of its proper divisors (7916613003609).
20231344342311 is a wasteful number, since it uses less digits than its factorization.
20231344342311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293207889045.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 20231344342311 its reverse (11324344313202), we get a palindrome (31555688655513).
The spelling of 20231344342311 in words is "twenty trillion, two hundred thirty-one billion, three hundred forty-four million, three hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •