Base | Representation |
---|---|
bin | 1001001001011100111001… |
… | …10011000100100101010000 |
3 | 2122020001211000022220021120 |
4 | 10210232130303010211100 |
5 | 10114034442343342401 |
6 | 110441051240322240 |
7 | 4144221205604535 |
oct | 444563463044520 |
9 | 78201730286246 |
10 | 20115962480976 |
11 | 645614a44237a |
12 | 230a737173380 |
13 | b2bc08b7119b |
14 | 4d7891284d8c |
15 | 24d3e0654836 |
hex | 124b9ccc4950 |
20115962480976 has 160 divisors (see below), whose sum is σ = 53753972025600. Its totient is φ = 6477296025600.
The previous prime is 20115962480969. The next prime is 20115962481023. The reversal of 20115962480976 is 67908426951102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 506564610 + ... + 506604318.
It is an arithmetic number, because the mean of its divisors is an integer number (335962325160).
Almost surely, 220115962480976 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 20115962480976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26876986012800).
20115962480976 is an abundant number, since it is smaller than the sum of its proper divisors (33638009544624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20115962480976 is a wasteful number, since it uses less digits than its factorization.
20115962480976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41797 (or 41791 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 60.
The spelling of 20115962480976 in words is "twenty trillion, one hundred fifteen billion, nine hundred sixty-two million, four hundred eighty thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •