Base | Representation |
---|---|
bin | 11001110111011000… |
… | …11010100100000000 |
3 | 1022211202201020201120 |
4 | 30323230122210000 |
5 | 211414404311033 |
6 | 10213533432240 |
7 | 1001055313302 |
oct | 147354324400 |
9 | 38752636646 |
10 | 13886400768 |
11 | 5986569479 |
12 | 283663b680 |
13 | 1403c164b6 |
14 | 95a385972 |
15 | 5641941b3 |
hex | 33bb1a900 |
13886400768 has 144 divisors (see below), whose sum is σ = 39338006400. Its totient is φ = 4333600768.
The previous prime is 13886400767. The next prime is 13886400821. The reversal of 13886400768 is 86700468831.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 13886400768.
It is not an unprimeable number, because it can be changed into a prime (13886400767) 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, 2569333 + ... + 2574731.
It is an arithmetic number, because the mean of its divisors is an integer number (273180600).
Almost surely, 213886400768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13886400768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19669003200).
13886400768 is an abundant number, since it is smaller than the sum of its proper divisors (25451605632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13886400768 is a wasteful number, since it uses less digits than its factorization.
13886400768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5632 (or 5618 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 51.
The spelling of 13886400768 in words is "thirteen billion, eight hundred eighty-six million, four hundred thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •