Base | Representation |
---|---|
bin | 1100110010001000111110… |
… | …0011000010101100110100 |
3 | 1211202200210211201101001222 |
4 | 3030202033203002230310 |
5 | 3320241222034224000 |
6 | 45521005422205512 |
7 | 2650323262652501 |
oct | 314421743025464 |
9 | 54680724641058 |
10 | 14055541320500 |
11 | 4529a15714859 |
12 | 16b0084423898 |
13 | 7ac57ca44234 |
14 | 368412ad04a8 |
15 | 19593bec5a85 |
hex | cc88f8c2b34 |
14055541320500 has 48 divisors (see below), whose sum is σ = 30717919923600. Its totient is φ = 5618440396800.
The previous prime is 14055541320497. The next prime is 14055541320511. The reversal of 14055541320500 is 502314555041.
It can be written as a sum of positive squares in 8 ways, for example, as 1816920676624 + 12238620643876 = 1347932^2 + 3498374^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8695085 + ... + 10184084.
It is an arithmetic number, because the mean of its divisors is an integer number (639956665075).
Almost surely, 214055541320500 is an apocalyptic number.
14055541320500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14055541320500 is an abundant number, since it is smaller than the sum of its proper divisors (16662378603100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14055541320500 is a wasteful number, since it uses less digits than its factorization.
14055541320500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18880677 (or 18880665 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
Adding to 14055541320500 its reverse (502314555041), we get a palindrome (14557855875541).
The spelling of 14055541320500 in words is "fourteen trillion, fifty-five billion, five hundred forty-one million, three hundred twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •