Base | Representation |
---|---|
bin | 11111000010011000… |
… | …11111101011000110 |
3 | 1121000021110200201012 |
4 | 33201030133223012 |
5 | 233111220112300 |
6 | 11353243002222 |
7 | 1126632411320 |
oct | 174114375306 |
9 | 47007420635 |
10 | 16663050950 |
11 | 7080948897 |
12 | 3290509372 |
13 | 1757259680 |
14 | b4104c610 |
15 | 677d1a435 |
hex | 3e131fac6 |
16663050950 has 96 divisors (see below), whose sum is σ = 38606029056. Its totient is φ = 5209925760.
The previous prime is 16663050941. The next prime is 16663050991. The reversal of 16663050950 is 5905036661.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16663050898 and 16663050907.
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 47 ways as a sum of consecutive naturals, for example, 355589 + ... + 399711.
It is an arithmetic number, because the mean of its divisors is an integer number (402146136).
Almost surely, 216663050950 is an apocalyptic number.
16663050950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16663050950 is an abundant number, since it is smaller than the sum of its proper divisors (21942978106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16663050950 is a wasteful number, since it uses less digits than its factorization.
16663050950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44238 (or 44233 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 41.
The spelling of 16663050950 in words is "sixteen billion, six hundred sixty-three million, fifty thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •