Base | Representation |
---|---|
bin | 1001001101000100000100… |
… | …00010110100001001010100 |
3 | 2122122221011010010221220022 |
4 | 10212202002002310021110 |
5 | 10123103124311042313 |
6 | 111014054141324312 |
7 | 4156203513420020 |
oct | 446420202641124 |
9 | 78587133127808 |
10 | 20240067674708 |
11 | 64a38455aa292 |
12 | 232a7b1866698 |
13 | b3a8266bb76b |
14 | 4dd8a58c5380 |
15 | 251755c0dc08 |
hex | 1268820b4254 |
20240067674708 has 24 divisors (see below), whose sum is σ = 41467455726144. Its totient is φ = 8462746065600.
The previous prime is 20240067674693. The next prime is 20240067674711. The reversal of 20240067674708 is 80747676004202.
It is a super-2 number, since 2×202400676747082 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20240067674708.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8815359338 + ... + 8815361633.
It is an arithmetic number, because the mean of its divisors is an integer number (1727810655256).
Almost surely, 220240067674708 is an apocalyptic number.
20240067674708 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
20240067674708 is an abundant number, since it is smaller than the sum of its proper divisors (21227388051436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20240067674708 is a wasteful number, since it uses less digits than its factorization.
20240067674708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17630721023 (or 17630721021 counting only the distinct ones).
The product of its (nonzero) digits is 6322176, while the sum is 53.
The spelling of 20240067674708 in words is "twenty trillion, two hundred forty billion, sixty-seven million, six hundred seventy-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •