Base | Representation |
---|---|
bin | 1001010000001010001001… |
… | …11011100000101111001111 |
3 | 2200001002122202021200122122 |
4 | 10220011010323200233033 |
5 | 10131323430113014211 |
6 | 111135003102403155 |
7 | 4166660111662553 |
oct | 450050473405717 |
9 | 80032582250578 |
10 | 20346416532431 |
11 | 6534959780140 |
12 | 23473318904bb |
13 | b47874640242 |
14 | 504ab3c05863 |
15 | 2543cc4e16db |
hex | 128144ee0bcf |
20346416532431 has 8 divisors (see below), whose sum is σ = 22527375700224. Its totient is φ = 18220671520920.
The previous prime is 20346416532383. The next prime is 20346416532433. The reversal of 20346416532431 is 13423561464302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20346416532431 - 238 = 20071538625487 is a prime.
It is a super-2 number, since 2×203464165324312 (a number of 27 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 (20346416532433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13803538295 + ... + 13803539768.
It is an arithmetic number, because the mean of its divisors is an integer number (2815921962528).
Almost surely, 220346416532431 is an apocalyptic number.
20346416532431 is a deficient number, since it is larger than the sum of its proper divisors (2180959167793).
20346416532431 is a wasteful number, since it uses less digits than its factorization.
20346416532431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27607078141.
The product of its (nonzero) digits is 1244160, while the sum is 44.
Adding to 20346416532431 its reverse (13423561464302), we get a palindrome (33769977996733).
The spelling of 20346416532431 in words is "twenty trillion, three hundred forty-six billion, four hundred sixteen million, five hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •