Base | Representation |
---|---|
bin | 1001010010001100000010… |
… | …01001000101101001110100 |
3 | 2200021202122022221212210120 |
4 | 10221012001021011221310 |
5 | 10133444231411414304 |
6 | 111231014215251540 |
7 | 4205006064251535 |
oct | 451060111055164 |
9 | 80252568855716 |
10 | 20416146201204 |
11 | 6561491312376 |
12 | 2358952079bb0 |
13 | b51307a77090 |
14 | 50820a96c68c |
15 | 25610e0040d9 |
hex | 129181245a74 |
20416146201204 has 96 divisors (see below), whose sum is σ = 51702290403456. Its totient is φ = 6232905469440.
The previous prime is 20416146201167. The next prime is 20416146201251. The reversal of 20416146201204 is 40210264161402.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128197194 + ... + 128356350.
It is an arithmetic number, because the mean of its divisors is an integer number (538565525036).
Almost surely, 220416146201204 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 20416146201204, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25851145201728).
20416146201204 is an abundant number, since it is smaller than the sum of its proper divisors (31286144202252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20416146201204 is a wasteful number, since it uses less digits than its factorization.
20416146201204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165585 (or 165583 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
The spelling of 20416146201204 in words is "twenty trillion, four hundred sixteen billion, one hundred forty-six million, two hundred one thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •