Base | Representation |
---|---|
bin | 11111100110011100… |
… | …11011111111100010 |
3 | 1121210100200020110120 |
4 | 33303032123333202 |
5 | 234221140100200 |
6 | 11443250341110 |
7 | 1140264540021 |
oct | 176316337742 |
9 | 47710606416 |
10 | 16965550050 |
11 | 7216679949 |
12 | 335588a796 |
13 | 17a4b20b17 |
14 | b6d2b28b8 |
15 | 69466e9a0 |
hex | 3f339bfe2 |
16965550050 has 48 divisors (see below), whose sum is σ = 42969785472. Its totient is φ = 4427886400.
The previous prime is 16965550037. The next prime is 16965550057. The reversal of 16965550050 is 5005556961.
It is a junction number, because it is equal to n+sod(n) for n = 16965549984 and 16965550011.
It is not an unprimeable number, because it can be changed into a prime (16965550057) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 1196181 + ... + 1210280.
It is an arithmetic number, because the mean of its divisors is an integer number (895203864).
Almost surely, 216965550050 is an apocalyptic number.
16965550050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16965550050 is an abundant number, since it is smaller than the sum of its proper divisors (26004235422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16965550050 is a wasteful number, since it uses less digits than its factorization.
16965550050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2406523 (or 2406518 counting only the distinct ones).
The product of its (nonzero) digits is 202500, while the sum is 42.
The spelling of 16965550050 in words is "sixteen billion, nine hundred sixty-five million, five hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •