Base | Representation |
---|---|
bin | 1001000110101010100110… |
… | …10010110101101100110011 |
3 | 2121212220201221121202101202 |
4 | 10203111103102311230303 |
5 | 10111002422420423011 |
6 | 110325100555521415 |
7 | 4134262132220300 |
oct | 443252322655463 |
9 | 77786657552352 |
10 | 20020240014131 |
11 | 641959961a245 |
12 | 22b4081a5926b |
13 | b22b92615a66 |
14 | 4d2db03800a7 |
15 | 24ab8bc1223b |
hex | 1235534b5b33 |
20020240014131 has 36 divisors (see below), whose sum is σ = 24603915516480. Its totient is φ = 16240618104480.
The previous prime is 20020240014107. The next prime is 20020240014149. The reversal of 20020240014131 is 13141004202002.
It is a de Polignac number, because none of the positive numbers 2k-20020240014131 is a prime.
It is a super-2 number, since 2×200202400141312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20020240014331) 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 35 ways as a sum of consecutive naturals, for example, 16958765 + ... + 18100833.
It is an arithmetic number, because the mean of its divisors is an integer number (683442097680).
Almost surely, 220020240014131 is an apocalyptic number.
20020240014131 is a deficient number, since it is larger than the sum of its proper divisors (4583675502349).
20020240014131 is a wasteful number, since it uses less digits than its factorization.
20020240014131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1143112 (or 1143086 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 20020240014131 its reverse (13141004202002), we get a palindrome (33161244216133).
The spelling of 20020240014131 in words is "twenty trillion, twenty billion, two hundred forty million, fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •