Base | Representation |
---|---|
bin | 1100000000010111001001… |
… | …1110101101011000011000 |
3 | 1201201221102110001212200201 |
4 | 3000011302132231120120 |
5 | 3212233311404402212 |
6 | 44024054234511544 |
7 | 2531460051325216 |
oct | 300056236553030 |
9 | 51657373055621 |
10 | 13200355153432 |
11 | 422a26a395a27 |
12 | 15923982955b4 |
13 | 749a32746345 |
14 | 338c87355cb6 |
15 | 17d588db1b57 |
hex | c01727ad618 |
13200355153432 has 32 divisors (see below), whose sum is σ = 25073437478400. Its totient is φ = 6514168306464.
The previous prime is 13200355153423. The next prime is 13200355153439. The reversal of 13200355153432 is 23435155300231.
It is a super-2 number, since 2×132003551534322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13200355153391 and 13200355153400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200355153439) by changing a digit.
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, 2272438 + ... + 5618245.
It is an arithmetic number, because the mean of its divisors is an integer number (783544921200).
Almost surely, 213200355153432 is an apocalyptic number.
It is an amenable number.
13200355153432 is a deficient number, since it is larger than the sum of its proper divisors (11873082324968).
13200355153432 is a wasteful number, since it uses less digits than its factorization.
13200355153432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7893415 (or 7893411 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 37.
The spelling of 13200355153432 in words is "thirteen trillion, two hundred billion, three hundred fifty-five million, one hundred fifty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •