Base | Representation |
---|---|
bin | 1100001101011110011001… |
… | …0010011110100000000000 |
3 | 1202112110220200111010011010 |
4 | 3003113212102132200000 |
5 | 3224431200404400300 |
6 | 44315352513520520 |
7 | 2553653533340610 |
oct | 303274622364000 |
9 | 52473820433133 |
10 | 13425636403200 |
11 | 430686482027a |
12 | 1609b8a573140 |
13 | 7650556331b8 |
14 | 345b38cb2a40 |
15 | 184371a61a50 |
hex | c35e649e800 |
13425636403200 has 1152 divisors, whose sum is σ = 52892314675200. Its totient is φ = 2940260843520.
The previous prime is 13425636403177. The next prime is 13425636403211. The reversal of 13425636403200 is 230463652431.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2450378061 + ... + 2450383539.
It is an arithmetic number, because the mean of its divisors is an integer number (45913467600).
Almost surely, 213425636403200 is an apocalyptic number.
13425636403200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13425636403200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26446157337600).
13425636403200 is an abundant number, since it is smaller than the sum of its proper divisors (39466678272000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13425636403200 is a wasteful number, since it uses less digits than its factorization.
13425636403200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5617 (or 5592 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 39.
The spelling of 13425636403200 in words is "thirteen trillion, four hundred twenty-five billion, six hundred thirty-six million, four hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •