Base | Representation |
---|---|
bin | 11111100100011100… |
… | …01100111010001010 |
3 | 1121202011222201200220 |
4 | 33302032030322022 |
5 | 234202332223200 |
6 | 11441445410510 |
7 | 1140001444515 |
oct | 176216147212 |
9 | 47664881626 |
10 | 16948711050 |
11 | 7208118517 |
12 | 3350109a36 |
13 | 17a14a640b |
14 | b6ad6bd7c |
15 | 692e454a0 |
hex | 3f238ce8a |
16948711050 has 24 divisors (see below), whose sum is σ = 42032803776. Its totient is φ = 4519656240.
The previous prime is 16948711033. The next prime is 16948711061. The reversal of 16948711050 is 5011784961.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16948710993 and 16948711011.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56495554 + ... + 56495853.
It is an arithmetic number, because the mean of its divisors is an integer number (1751366824).
Almost surely, 216948711050 is an apocalyptic number.
16948711050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16948711050 is an abundant number, since it is smaller than the sum of its proper divisors (25084092726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16948711050 is a wasteful number, since it uses less digits than its factorization.
16948711050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112991422 (or 112991417 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 42.
The spelling of 16948711050 in words is "sixteen billion, nine hundred forty-eight million, seven hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •