Base | Representation |
---|---|
bin | 11001110100111011… |
… | …01001111000100000 |
3 | 1022210022212021212210 |
4 | 30322131221320200 |
5 | 211344113113034 |
6 | 10211515122120 |
7 | 1000414652124 |
oct | 147235517040 |
9 | 38708767783 |
10 | 13865754144 |
11 | 5975947350 |
12 | 282b743340 |
13 | 13cc867968 |
14 | 95772d584 |
15 | 5624668e9 |
hex | 33a769e20 |
13865754144 has 96 divisors (see below), whose sum is σ = 40779740736. Its totient is φ = 4088171520.
The previous prime is 13865754139. The next prime is 13865754163. The reversal of 13865754144 is 44145756831.
13865754144 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 13865754093 and 13865754102.
It is an unprimeable number.
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, 138367 + ... + 216510.
It is an arithmetic number, because the mean of its divisors is an integer number (424788966).
Almost surely, 213865754144 is an apocalyptic number.
It is an amenable number.
13865754144 is an abundant number, since it is smaller than the sum of its proper divisors (26913986592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13865754144 is a wasteful number, since it uses less digits than its factorization.
13865754144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354938 (or 354930 counting only the distinct ones).
The product of its digits is 1612800, while the sum is 48.
The spelling of 13865754144 in words is "thirteen billion, eight hundred sixty-five million, seven hundred fifty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •