Base | Representation |
---|---|
bin | 1100001100101101100010… |
… | …1111001101001000111000 |
3 | 1202111020001212110201002210 |
4 | 3003023120233031020320 |
5 | 3224222322140320402 |
6 | 44305343432455120 |
7 | 2553010565132244 |
oct | 303133057151070 |
9 | 52436055421083 |
10 | 13412524151352 |
11 | 43012462463a7 |
12 | 160752b24a4a0 |
13 | 763a45c1b1b1 |
14 | 345253687424 |
15 | 183d5583a06c |
hex | c32d8bcd238 |
13412524151352 has 32 divisors (see below), whose sum is σ = 33744885613200. Its totient is φ = 4442364685824.
The previous prime is 13412524151347. The next prime is 13412524151363. The reversal of 13412524151352 is 25315142521431.
It is a super-2 number, since 2×134125241513522 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13412524151352.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1779789777 + ... + 1779797312.
Almost surely, 213412524151352 is an apocalyptic number.
13412524151352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13412524151352 is an abundant number, since it is smaller than the sum of its proper divisors (20332361461848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13412524151352 is a wasteful number, since it uses less digits than its factorization.
13412524151352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3559587255 (or 3559587251 counting only the distinct ones).
The product of its digits is 144000, while the sum is 39.
Adding to 13412524151352 its reverse (25315142521431), we get a palindrome (38727666672783).
The spelling of 13412524151352 in words is "thirteen trillion, four hundred twelve billion, five hundred twenty-four million, one hundred fifty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •