Base | Representation |
---|---|
bin | 1001001001101100001100… |
… | …10100001111110111011000 |
3 | 2122020212000101002002222121 |
4 | 10210312012110033313120 |
5 | 10114203302330032233 |
6 | 110444530220231024 |
7 | 4144631552066434 |
oct | 444660624176730 |
9 | 78225011062877 |
10 | 20124175236568 |
11 | 6459684315197 |
12 | 231024969b474 |
13 | b2c9174b6490 |
14 | 4d802dcd19c4 |
15 | 24d72167892d |
hex | 124d8650fdd8 |
20124175236568 has 128 divisors (see below), whose sum is σ = 41529445574400. Its totient is φ = 9086551488000.
The previous prime is 20124175236551. The next prime is 20124175236593. The reversal of 20124175236568 is 86563257142102.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 308039155 + ... + 308104477.
It is an arithmetic number, because the mean of its divisors is an integer number (324448793550).
Almost surely, 220124175236568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20124175236568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20764722787200).
20124175236568 is an abundant number, since it is smaller than the sum of its proper divisors (21405270337832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20124175236568 is a wasteful number, since it uses less digits than its factorization.
20124175236568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65793 (or 65789 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 52.
The spelling of 20124175236568 in words is "twenty trillion, one hundred twenty-four billion, one hundred seventy-five million, two hundred thirty-six thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •