Base | Representation |
---|---|
bin | 11011101011100010… |
… | …10010001110000000 |
3 | 1102100200010121121110 |
4 | 31311301102032000 |
5 | 220413323141330 |
6 | 10454341323320 |
7 | 1034156224530 |
oct | 156561221600 |
9 | 42320117543 |
10 | 14860755840 |
11 | 63365668a7 |
12 | 2a68a06540 |
13 | 152aa44a68 |
14 | a0d9394c0 |
15 | 5be9abdb0 |
hex | 375c52380 |
14860755840 has 128 divisors (see below), whose sum is σ = 54135659520. Its totient is φ = 3396741120.
The previous prime is 14860755829. The next prime is 14860755841. The reversal of 14860755840 is 4855706841.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 14860755840.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14860755841) 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, 539416 + ... + 566295.
It is an arithmetic number, because the mean of its divisors is an integer number (422934840).
Almost surely, 214860755840 is an apocalyptic number.
14860755840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14860755840 is an abundant number, since it is smaller than the sum of its proper divisors (39274903680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14860755840 is a wasteful number, since it uses less digits than its factorization.
14860755840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1105740 (or 1105728 counting only the distinct ones).
The product of its (nonzero) digits is 1075200, while the sum is 48.
The spelling of 14860755840 in words is "fourteen billion, eight hundred sixty million, seven hundred fifty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •