Base | Representation |
---|---|
bin | 1100101001011101101111… |
… | …0100000000011000101000 |
3 | 1211020110002200111102021222 |
4 | 3022113123310000120220 |
5 | 3310321001211334040 |
6 | 45324320112521212 |
7 | 2633465646660164 |
oct | 312273364003050 |
9 | 54213080442258 |
10 | 13906496980520 |
11 | 4481792005181 |
12 | 1687209850208 |
13 | 79b4b9478ba1 |
14 | 361114227ca4 |
15 | 191b17269bb5 |
hex | ca5dbd00628 |
13906496980520 has 32 divisors (see below), whose sum is σ = 31290571960200. Its totient is φ = 5562429235968.
The previous prime is 13906496980447. The next prime is 13906496980543. The reversal of 13906496980520 is 2508969460931.
It can be written as a sum of positive squares in 4 ways, for example, as 10435109436964 + 3471387543556 = 3230342^2 + 1863166^2 .
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 7 ways as a sum of consecutive naturals, for example, 3965819 + ... + 6598538.
Almost surely, 213906496980520 is an apocalyptic number.
13906496980520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13906496980520 is an abundant number, since it is smaller than the sum of its proper divisors (17384074979680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13906496980520 is a wasteful number, since it uses less digits than its factorization.
13906496980520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10597277 (or 10597273 counting only the distinct ones).
The product of its (nonzero) digits is 25194240, while the sum is 62.
The spelling of 13906496980520 in words is "thirteen trillion, nine hundred six billion, four hundred ninety-six million, nine hundred eighty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •