Base | Representation |
---|---|
bin | 1110100110010110101111… |
… | …1011000001100001110100 |
3 | 2002211120021200112210011122 |
4 | 3221211223323001201310 |
5 | 4100444201433420040 |
6 | 54050122353123112 |
7 | 3244504041541223 |
oct | 351455373014164 |
9 | 62746250483148 |
10 | 16052103420020 |
11 | 51297279a3078 |
12 | 1973008b59498 |
13 | 8c5925c72765 |
14 | 3d6cd6b48cba |
15 | 1cc8432611b5 |
hex | e996bec1874 |
16052103420020 has 24 divisors (see below), whose sum is σ = 33709492852224. Its totient is φ = 6420826954656.
The previous prime is 16052103420019. The next prime is 16052103420049. The reversal of 16052103420020 is 2002430125061.
It is a happy number.
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 7 ways as a sum of consecutive naturals, for example, 15632477 + ... + 16627643.
It is an arithmetic number, because the mean of its divisors is an integer number (1404562202176).
Almost surely, 216052103420020 is an apocalyptic number.
16052103420020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16052103420020 is an abundant number, since it is smaller than the sum of its proper divisors (17657389432204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16052103420020 is a wasteful number, since it uses less digits than its factorization.
16052103420020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1801679 (or 1801677 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 16052103420020 its reverse (2002430125061), we get a palindrome (18054533545081).
The spelling of 16052103420020 in words is "sixteen trillion, fifty-two billion, one hundred three million, four hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •