Base | Representation |
---|---|
bin | 1001010001110001111001… |
… | …10000111111010010011111 |
3 | 2200020102102102010212022112 |
4 | 10220320330300333102133 |
5 | 10133232012204143403 |
6 | 111220333555304235 |
7 | 4204001256523265 |
oct | 450707460772237 |
9 | 80212372125275 |
10 | 20402114131103 |
11 | 65565405aa421 |
12 | 23560968ab07b |
13 | b4cbac919c13 |
14 | 507679108435 |
15 | 255a8c1889d8 |
hex | 128e3cc3f49f |
20402114131103 has 8 divisors (see below), whose sum is σ = 20900549818176. Its totient is φ = 19903717641600.
The previous prime is 20402114131093. The next prime is 20402114131123. The reversal of 20402114131103 is 30113141120402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20402114131103 - 28 = 20402114130847 is a prime.
It is a super-2 number, since 2×204021141311032 (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 (20402114131123) 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, 8744318 + ... + 10829003.
It is an arithmetic number, because the mean of its divisors is an integer number (2612568727272).
Almost surely, 220402114131103 is an apocalyptic number.
20402114131103 is a deficient number, since it is larger than the sum of its proper divisors (498435687073).
20402114131103 is a wasteful number, since it uses less digits than its factorization.
20402114131103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19598785.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 20402114131103 its reverse (30113141120402), we get a palindrome (50515255251505).
The spelling of 20402114131103 in words is "twenty trillion, four hundred two billion, one hundred fourteen million, one hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.528 sec. • engine limits •