Base | Representation |
---|---|
bin | 11011000001001000… |
… | …11100010111000000 |
3 | 1101102212211210120120 |
4 | 31200210130113000 |
5 | 214201244133333 |
6 | 10355153540240 |
7 | 1022310020616 |
oct | 154044342700 |
9 | 41385753516 |
10 | 14505067968 |
11 | 6173807286 |
12 | 2989874680 |
13 | 14a2149971 |
14 | 9b85cb6b6 |
15 | 59d64cdb3 |
hex | 36091c5c0 |
14505067968 has 56 divisors (see below), whose sum is σ = 39415254672. Its totient is φ = 4704344064.
The previous prime is 14505067963. The next prime is 14505067991. The reversal of 14505067968 is 86976050541.
It is a self number, because there is not a number n which added to its sum of digits gives 14505067968.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14505067963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1013805 + ... + 1028012.
Almost surely, 214505067968 is an apocalyptic number.
It is an amenable number.
14505067968 is an abundant number, since it is smaller than the sum of its proper divisors (24910186704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14505067968 is a wasteful number, since it uses less digits than its factorization.
14505067968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041869 (or 2041859 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 51.
The spelling of 14505067968 in words is "fourteen billion, five hundred five million, sixty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •