Base | Representation |
---|---|
bin | 1100000000010101010100… |
… | …0111001000101011110000 |
3 | 1201201220011002221011110000 |
4 | 3000011111013020223300 |
5 | 3212231304240401134 |
6 | 44023533314110000 |
7 | 2531441616305052 |
oct | 300052507105360 |
9 | 51656132834400 |
10 | 13199862434544 |
11 | 422a037251a35 |
12 | 159227b27b300 |
13 | 7499846403c6 |
14 | 338c3bb378d2 |
15 | 17d55a9d5e99 |
hex | c01551c8af0 |
13199862434544 has 50 divisors (see below), whose sum is σ = 38204231479040. Its totient is φ = 4399954144416.
The previous prime is 13199862434543. The next prime is 13199862434609. The reversal of 13199862434544 is 44543426899131.
13199862434544 is a `hidden beast` number, since 1 + 3 + 1 + 9 + 9 + 86 + 2 + 4 + 3 + 4 + 544 = 666.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13199862434543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5092538224 + ... + 5092540815.
Almost surely, 213199862434544 is an apocalyptic number.
It is an amenable number.
13199862434544 is an abundant number, since it is smaller than the sum of its proper divisors (25004369044496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13199862434544 is a wasteful number, since it uses less digits than its factorization.
13199862434544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10185079059 (or 10185079044 counting only the distinct ones).
The product of its digits is 89579520, while the sum is 63.
The spelling of 13199862434544 in words is "thirteen trillion, one hundred ninety-nine billion, eight hundred sixty-two million, four hundred thirty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •