Base | Representation |
---|---|
bin | 1110111101000011010011… |
… | …1110100010110111010010 |
3 | 2011012211201220012021001122 |
4 | 3233100310332202313102 |
5 | 4123341231021320200 |
6 | 54545210020202242 |
7 | 3314616446546300 |
oct | 357206476426722 |
9 | 64184656167048 |
10 | 16442023620050 |
11 | 526a028766576 |
12 | 1a166a8539382 |
13 | 923626203302 |
14 | 40bb26335270 |
15 | 1d7a64c87385 |
hex | ef434fa2dd2 |
16442023620050 has 72 divisors (see below), whose sum is σ = 35907649089264. Its totient is φ = 5584580430240.
The previous prime is 16442023620049. The next prime is 16442023620053. The reversal of 16442023620050 is 5002632024461.
It is a super-3 number, since 3×164420236200503 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is not an unprimeable number, because it can be changed into a prime (16442023620053) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 31097804 + ... + 31622103.
It is an arithmetic number, because the mean of its divisors is an integer number (498717348462).
Almost surely, 216442023620050 is an apocalyptic number.
16442023620050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16442023620050 is an abundant number, since it is smaller than the sum of its proper divisors (19465625469214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16442023620050 is a wasteful number, since it uses less digits than its factorization.
16442023620050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62720040 (or 62720028 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 16442023620050 in words is "sixteen trillion, four hundred forty-two billion, twenty-three million, six hundred twenty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •