Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …00101101001110011111011 |
3 | 2121212220122100222101211222 |
4 | 10203111101011221303323 |
5 | 10111002333432100011 |
6 | 110325053154342255 |
7 | 4134261202511432 |
oct | 443252105516373 |
9 | 77786570871758 |
10 | 20020203003131 |
11 | 641957a740341 |
12 | 22b407158a98b |
13 | b22b87a57866 |
14 | 4d2da94a8119 |
15 | 24ab88850ddb |
hex | 123551169cfb |
20020203003131 has 16 divisors (see below), whose sum is σ = 20767793356800. Its totient is φ = 19279201767840.
The previous prime is 20020203003107. The next prime is 20020203003133. The reversal of 20020203003131 is 13130030202002.
It is a cyclic number.
It is not a de Polignac number, because 20020203003131 - 226 = 20020135894267 is a prime.
It is a super-2 number, since 2×200202030031312 (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 (20020203003133) 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 15 ways as a sum of consecutive naturals, for example, 3368990 + ... + 7168716.
It is an arithmetic number, because the mean of its divisors is an integer number (1297987084800).
Almost surely, 220020203003131 is an apocalyptic number.
20020203003131 is a deficient number, since it is larger than the sum of its proper divisors (747590353669).
20020203003131 is a wasteful number, since it uses less digits than its factorization.
20020203003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3800594.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20020203003131 its reverse (13130030202002), we get a palindrome (33150233205133).
The spelling of 20020203003131 in words is "twenty trillion, twenty billion, two hundred three million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •