Base | Representation |
---|---|
bin | 11011001000001011… |
… | …00010111110000000 |
3 | 1101120222212210100120 |
4 | 31210011202332000 |
5 | 214311400434230 |
6 | 10405102420240 |
7 | 1023624421113 |
oct | 154405427600 |
9 | 41528783316 |
10 | 14564077440 |
11 | 61a4050a40 |
12 | 29a5591680 |
13 | 14b143ab03 |
14 | 9c238c57a |
15 | 5a3907310 |
hex | 364162f80 |
14564077440 has 128 divisors (see below), whose sum is σ = 50643342720. Its totient is φ = 3530680320.
The previous prime is 14564077379. The next prime is 14564077447. The reversal of 14564077440 is 4477046541.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×145640774402 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14564077392 and 14564077401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14564077447) 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, 323674 + ... + 365913.
It is an arithmetic number, because the mean of its divisors is an integer number (395651115).
Almost surely, 214564077440 is an apocalyptic number.
14564077440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14564077440 is an abundant number, since it is smaller than the sum of its proper divisors (36079265280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14564077440 is a wasteful number, since it uses less digits than its factorization.
14564077440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 689620 (or 689608 counting only the distinct ones).
The product of its (nonzero) digits is 376320, while the sum is 42.
The spelling of 14564077440 in words is "fourteen billion, five hundred sixty-four million, seventy-seven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •