Base | Representation |
---|---|
bin | 11110000011111011… |
… | …00100110110001000 |
3 | 1112122202110111102211 |
4 | 33001331210312020 |
5 | 231023043440110 |
6 | 11225243434504 |
7 | 1110640426030 |
oct | 170175446610 |
9 | 45582414384 |
10 | 16139046280 |
11 | 6932086385 |
12 | 3164b25a34 |
13 | 16a281b436 |
14 | ad16088c0 |
15 | 646d0e98a |
hex | 3c1f64d88 |
16139046280 has 64 divisors (see below), whose sum is σ = 42622064640. Its totient is φ = 5383832832.
The previous prime is 16139046257. The next prime is 16139046283. The reversal of 16139046280 is 8264093161.
16139046280 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (16139046283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 768552 + ... + 789271.
It is an arithmetic number, because the mean of its divisors is an integer number (665969760).
Almost surely, 216139046280 is an apocalyptic number.
16139046280 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16139046280 is an abundant number, since it is smaller than the sum of its proper divisors (26483018360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16139046280 is a wasteful number, since it uses less digits than its factorization.
16139046280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1557878 (or 1557874 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 40.
The spelling of 16139046280 in words is "sixteen billion, one hundred thirty-nine million, forty-six thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •