Base | Representation |
---|---|
bin | 11011000111010101… |
… | …11111011010101000 |
3 | 1101120111210010011010 |
4 | 31203222333122220 |
5 | 214303110203242 |
6 | 10404253303520 |
7 | 1023511305432 |
oct | 154352773250 |
9 | 41514703133 |
10 | 14557116072 |
11 | 61a0126844 |
12 | 29a3194ba0 |
13 | 14acb71365 |
14 | 9c1499652 |
15 | 5a2ece89c |
hex | 363abf6a8 |
14557116072 has 64 divisors (see below), whose sum is σ = 36788544000. Its totient is φ = 4799715264.
The previous prime is 14557116071. The next prime is 14557116089. The reversal of 14557116072 is 27061175541.
It is a self number, because there is not a number n which added to its sum of digits gives 14557116072.
It is not an unprimeable number, because it can be changed into a prime (14557116071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2516079 + ... + 2521857.
It is an arithmetic number, because the mean of its divisors is an integer number (574821000).
Almost surely, 214557116072 is an apocalyptic number.
14557116072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14557116072 is an abundant number, since it is smaller than the sum of its proper divisors (22231427928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14557116072 is a wasteful number, since it uses less digits than its factorization.
14557116072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6910 (or 6906 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 39.
The spelling of 14557116072 in words is "fourteen billion, five hundred fifty-seven million, one hundred sixteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •