Base | Representation |
---|---|
bin | 1001001011110001100001… |
… | …11000100111101111011000 |
3 | 2122111200202222121201000212 |
4 | 10211320300320213233120 |
5 | 10121341402113000000 |
6 | 110541445152350252 |
7 | 4153044445531223 |
oct | 445706070475730 |
9 | 78450688551025 |
10 | 20195756375000 |
11 | 6486a76a75a38 |
12 | 23220a5b45388 |
13 | b365b43916ab |
14 | 4db6a08cc5ba |
15 | 2505109aec35 |
hex | 125e30e27bd8 |
20195756375000 has 56 divisors (see below), whose sum is σ = 47333198424180. Its totient is φ = 8078302500000.
The previous prime is 20195756374951. The next prime is 20195756375029. The reversal of 20195756375000 is 57365759102.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 20195756375000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 80658026 + ... + 80908025.
Almost surely, 220195756375000 is an apocalyptic number.
20195756375000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20195756375000 is an abundant number, since it is smaller than the sum of its proper divisors (27137442049180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20195756375000 is an frugal number, since it uses more digits than its factorization.
20195756375000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161566087 (or 161566058 counting only the distinct ones).
The product of its (nonzero) digits is 1984500, while the sum is 50.
The spelling of 20195756375000 in words is "twenty trillion, one hundred ninety-five billion, seven hundred fifty-six million, three hundred seventy-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •