Base | Representation |
---|---|
bin | 1001001111110011000001… |
… | …10111110011100010100111 |
3 | 2122222220121110011212202212 |
4 | 10213321200313303202213 |
5 | 10131123013101433111 |
6 | 111125151050154035 |
7 | 4166040325532213 |
oct | 447714067634247 |
9 | 78886543155685 |
10 | 20334000421031 |
11 | 652a668149950 |
12 | 2344a4772291b |
13 | b4664621596b |
14 | 504256c2b943 |
15 | 253e0247898b |
hex | 127e60df38a7 |
20334000421031 has 16 divisors (see below), whose sum is σ = 22238893789056. Its totient is φ = 18438512820000.
The previous prime is 20334000421013. The next prime is 20334000421037. The reversal of 20334000421031 is 13012400043302.
It is a cyclic number.
It is not a de Polignac number, because 20334000421031 - 218 = 20334000158887 is a prime.
It is a super-2 number, since 2×203340004210312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20334000420988 and 20334000421006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20334000421037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28034576 + ... + 28750746.
It is an arithmetic number, because the mean of its divisors is an integer number (1389930861816).
Almost surely, 220334000421031 is an apocalyptic number.
20334000421031 is a deficient number, since it is larger than the sum of its proper divisors (1904893368025).
20334000421031 is a wasteful number, since it uses less digits than its factorization.
20334000421031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722734.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20334000421031 its reverse (13012400043302), we get a palindrome (33346400464333).
The spelling of 20334000421031 in words is "twenty trillion, three hundred thirty-four billion, four hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •