Base | Representation |
---|---|
bin | 11000110011111011… |
… | …11001110110110100 |
3 | 1021101022222120012000 |
4 | 30121331321312310 |
5 | 204240030410202 |
6 | 10041441455300 |
7 | 651044615022 |
oct | 143175716664 |
9 | 37338876160 |
10 | 13320560052 |
11 | 5716121a18 |
12 | 26b9041530 |
13 | 134391aac7 |
14 | 905171712 |
15 | 52e67291c |
hex | 319f79db4 |
13320560052 has 96 divisors (see below), whose sum is σ = 38490883200. Its totient is φ = 3959041536.
The previous prime is 13320560051. The next prime is 13320560059. The reversal of 13320560052 is 25006502331.
13320560052 is a `hidden beast` number, since 1 + 3 + 3 + 2 + 0 + 5 + 600 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 13320559998 and 13320560025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320560051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 156043 + ... + 225810.
It is an arithmetic number, because the mean of its divisors is an integer number (400946700).
Almost surely, 213320560052 is an apocalyptic number.
13320560052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13320560052 is an abundant number, since it is smaller than the sum of its proper divisors (25170323148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320560052 is a wasteful number, since it uses less digits than its factorization.
13320560052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381902 (or 381894 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The spelling of 13320560052 in words is "thirteen billion, three hundred twenty million, five hundred sixty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •