Base | Representation |
---|---|
bin | 1101001000011100010100… |
… | …0101010000001101111000 |
3 | 1220010022210020111202110220 |
4 | 3102013011011100031320 |
5 | 3343030420020224202 |
6 | 50413013205540040 |
7 | 3020106144233214 |
oct | 322070505201570 |
9 | 56108706452426 |
10 | 14438691570552 |
11 | 4667461a80677 |
12 | 1752394714620 |
13 | 809741547b22 |
14 | 37cb9d125944 |
15 | 1a08b44c5abc |
hex | d21c5150378 |
14438691570552 has 32 divisors (see below), whose sum is σ = 36278119536000. Its totient is φ = 4788711775584.
The previous prime is 14438691570533. The next prime is 14438691570557. The reversal of 14438691570552 is 25507519683441.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14438691570557) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1511583538 + ... + 1511593089.
It is an arithmetic number, because the mean of its divisors is an integer number (1133691235500).
It is a 1-persistent number, because it is pandigital, but 2⋅14438691570552 = 28877383141104 is not.
Almost surely, 214438691570552 is an apocalyptic number.
14438691570552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14438691570552 is an abundant number, since it is smaller than the sum of its proper divisors (21839427965448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14438691570552 is a wasteful number, since it uses less digits than its factorization.
14438691570552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3023176835 (or 3023176831 counting only the distinct ones).
The product of its (nonzero) digits is 36288000, while the sum is 60.
The spelling of 14438691570552 in words is "fourteen trillion, four hundred thirty-eight billion, six hundred ninety-one million, five hundred seventy thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •