Base | Representation |
---|---|
bin | 11000100111010111… |
… | …10011010010010100 |
3 | 1021002222122020111101 |
4 | 30103223303102110 |
5 | 204031034320002 |
6 | 10023154315444 |
7 | 645324634522 |
oct | 142353632224 |
9 | 37088566441 |
10 | 13215151252 |
11 | 5671676806 |
12 | 2689888b84 |
13 | 1327b32434 |
14 | 8d5173312 |
15 | 5252a0587 |
hex | 313af3494 |
13215151252 has 24 divisors (see below), whose sum is σ = 23177871360. Its totient is φ = 6592922400.
The previous prime is 13215151249. The next prime is 13215151253. The reversal of 13215151252 is 25215151231.
It is a happy number.
13215151252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×132151512522 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13215151252.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13215151253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4588749 + ... + 4591627.
It is an arithmetic number, because the mean of its divisors is an integer number (965744640).
Almost surely, 213215151252 is an apocalyptic number.
It is an amenable number.
13215151252 is a deficient number, since it is larger than the sum of its proper divisors (9962720108).
13215151252 is a wasteful number, since it uses less digits than its factorization.
13215151252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5031 (or 5029 counting only the distinct ones).
The product of its digits is 3000, while the sum is 28.
The spelling of 13215151252 in words is "thirteen billion, two hundred fifteen million, one hundred fifty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •