Base | Representation |
---|---|
bin | 1100000000011110010110… |
… | …0011000001110010101100 |
3 | 1201202010101222200001022220 |
4 | 3000013211203001302230 |
5 | 3212301240112243302 |
6 | 44025014000235340 |
7 | 2531555642365152 |
oct | 300074543016254 |
9 | 51663358601286 |
10 | 13202285665452 |
11 | 4230070091204 |
12 | 159283690bb50 |
13 | 749c7c6a0c50 |
14 | 338dcb8c33d2 |
15 | 17d64d5ea4bc |
hex | c01e58c1cac |
13202285665452 has 48 divisors (see below), whose sum is σ = 33176227257600. Its totient is φ = 4062088312128.
The previous prime is 13202285665403. The next prime is 13202285665501. The reversal of 13202285665452 is 25456658220231.
It is an interprime number because it is at equal distance from previous prime (13202285665403) and next prime (13202285665501).
It is a junction number, because it is equal to n+sod(n) for n = 13202285665395 and 13202285665404.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2580153 + ... + 5749935.
It is an arithmetic number, because the mean of its divisors is an integer number (691171401200).
Almost surely, 213202285665452 is an apocalyptic number.
13202285665452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13202285665452 is an abundant number, since it is smaller than the sum of its proper divisors (19973941592148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202285665452 is a wasteful number, since it uses less digits than its factorization.
13202285665452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3196502 (or 3196500 counting only the distinct ones).
The product of its (nonzero) digits is 6912000, while the sum is 51.
The spelling of 13202285665452 in words is "thirteen trillion, two hundred two billion, two hundred eighty-five million, six hundred sixty-five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •