Base | Representation |
---|---|
bin | 11000100001000011… |
… | …10101011000100000 |
3 | 1020222022000101021222 |
4 | 30100201311120200 |
5 | 203424011104002 |
6 | 10014023434212 |
7 | 644112624422 |
oct | 142041653040 |
9 | 36868011258 |
10 | 13162206752 |
11 | 56447a4822 |
12 | 2673bb5968 |
13 | 1319b85a26 |
14 | 8cc110812 |
15 | 5207e31a2 |
hex | 310875620 |
13162206752 has 54 divisors (see below), whose sum is σ = 27550152063. Its totient is φ = 6188787712.
The previous prime is 13162206751. The next prime is 13162206763. The reversal of 13162206752 is 25760226131.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 10395025936 + 2767180816 = 101956^2 + 52604^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=81124.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13162206751) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 11032268 + ... + 11033460.
Almost surely, 213162206752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13162206752
13162206752 is an abundant number, since it is smaller than the sum of its proper divisors (14387945311).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13162206752 is an frugal number, since it uses more digits than its factorization.
13162206752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2430 (or 1212 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 35.
The spelling of 13162206752 in words is "thirteen billion, one hundred sixty-two million, two hundred six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •