Base | Representation |
---|---|
bin | 1100110001111101100011… |
… | …1100100100000000001100 |
3 | 1211202101220100010101112021 |
4 | 3030133120330210000030 |
5 | 3320213433302424410 |
6 | 45515341424015524 |
7 | 2650154333205463 |
oct | 314373074440014 |
9 | 54671810111467 |
10 | 14052477779980 |
11 | 45286933a5492 |
12 | 16ab56a4615a4 |
13 | 7ac1b2143373 |
14 | 368201ca79da |
15 | 19580d07eeda |
hex | cc7d8f2400c |
14052477779980 has 48 divisors (see below), whose sum is σ = 29683205566560. Its totient is φ = 5588043614208.
The previous prime is 14052477779933. The next prime is 14052477780137. The reversal of 14052477779980 is 8997777425041.
It is a Smith number, since the sum of its digits (70) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43917532 + ... + 44236348.
It is an arithmetic number, because the mean of its divisors is an integer number (618400115970).
Almost surely, 214052477779980 is an apocalyptic number.
14052477779980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14052477779980 is an abundant number, since it is smaller than the sum of its proper divisors (15630727786580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14052477779980 is a wasteful number, since it uses less digits than its factorization.
14052477779980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331738 (or 331736 counting only the distinct ones).
The product of its (nonzero) digits is 248935680, while the sum is 70.
The spelling of 14052477779980 in words is "fourteen trillion, fifty-two billion, four hundred seventy-seven million, seven hundred seventy-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •