Base | Representation |
---|---|
bin | 11101111001101000… |
… | …01111010011001010 |
3 | 1112102202000021221222 |
4 | 32330310033103022 |
5 | 230333443301100 |
6 | 11212521202042 |
7 | 1105541543342 |
oct | 167464172312 |
9 | 45382007858 |
10 | 16052712650 |
11 | 6898379677 |
12 | 3140030322 |
13 | 168a981250 |
14 | ac3d73d22 |
15 | 63e459485 |
hex | 3bcd0f4ca |
16052712650 has 48 divisors (see below), whose sum is σ = 32168336928. Its totient is φ = 5924664000.
The previous prime is 16052712623. The next prime is 16052712653. The reversal of 16052712650 is 5621725061.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16052712650.
It is not an unprimeable number, because it can be changed into a prime (16052712653) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2395805 + ... + 2402495.
It is an arithmetic number, because the mean of its divisors is an integer number (670173686).
Almost surely, 216052712650 is an apocalyptic number.
16052712650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16052712650 is an abundant number, since it is smaller than the sum of its proper divisors (16115624278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16052712650 is a wasteful number, since it uses less digits than its factorization.
16052712650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10407 (or 10402 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 16052712650 in words is "sixteen billion, fifty-two million, seven hundred twelve thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •