Base | Representation |
---|---|
bin | 1001000110101010100001… |
… | …11010101010001100011001 |
3 | 2121212220122011112222110120 |
4 | 10203111100322222030121 |
5 | 10111002332212333423 |
6 | 110325053012503453 |
7 | 4134261136146153 |
oct | 443252072521431 |
9 | 77786564488416 |
10 | 20020200121113 |
11 | 6419579052005 |
12 | 22b407061ab89 |
13 | b22b87288b1a |
14 | 4d2da8d57ad3 |
15 | 24ab88481ee3 |
hex | 123550eaa319 |
20020200121113 has 32 divisors (see below), whose sum is σ = 26930615906304. Its totient is φ = 13228551960000.
The previous prime is 20020200121093. The next prime is 20020200121133. The reversal of 20020200121113 is 31112100202002.
It is an interprime number because it is at equal distance from previous prime (20020200121093) and next prime (20020200121133).
It is not a de Polignac number, because 20020200121113 - 26 = 20020200121049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20020200121092 and 20020200121101.
It is not an unprimeable number, because it can be changed into a prime (20020200121133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2414686498 + ... + 2414694788.
It is an arithmetic number, because the mean of its divisors is an integer number (841581747072).
Almost surely, 220020200121113 is an apocalyptic number.
It is an amenable number.
20020200121113 is a deficient number, since it is larger than the sum of its proper divisors (6910415785191).
20020200121113 is a wasteful number, since it uses less digits than its factorization.
20020200121113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15277.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20020200121113 its reverse (31112100202002), we get a palindrome (51132300323115).
The spelling of 20020200121113 in words is "twenty trillion, twenty billion, two hundred million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •