Base | Representation |
---|---|
bin | 1001001001111111000011… |
… | …11110110010101110010010 |
3 | 2122021211011012100101001120 |
4 | 10210333201332302232102 |
5 | 10114340023040110032 |
6 | 110453323210343110 |
7 | 4145440541066244 |
oct | 444774176625622 |
9 | 78254135311046 |
10 | 20134303050642 |
11 | 6462a01198870 |
12 | 23121b542aa96 |
13 | b3086c805481 |
14 | 4d8711006094 |
15 | 24db1588262c |
hex | 124fe1fb2b92 |
20134303050642 has 32 divisors (see below), whose sum is σ = 44192438728704. Its totient is φ = 6064769197200.
The previous prime is 20134303050619. The next prime is 20134303050691. The reversal of 20134303050642 is 24605030343102.
It is a happy number.
It is a super-2 number, since 2×201343030506422 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 913357834 + ... + 913379877.
It is an arithmetic number, because the mean of its divisors is an integer number (1381013710272).
Almost surely, 220134303050642 is an apocalyptic number.
20134303050642 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20134303050642 is an abundant number, since it is smaller than the sum of its proper divisors (24058135678062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20134303050642 is a wasteful number, since it uses less digits than its factorization.
20134303050642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1826737894.
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 20134303050642 its reverse (24605030343102), we get a palindrome (44739333393744).
The spelling of 20134303050642 in words is "twenty trillion, one hundred thirty-four billion, three hundred three million, fifty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •