Base | Representation |
---|---|
bin | 11000101011110011… |
… | …01011000111001101 |
3 | 1021012120121201220200 |
4 | 30111321223013031 |
5 | 204120044422341 |
6 | 10031003404113 |
7 | 646256023146 |
oct | 142571530715 |
9 | 37176551820 |
10 | 13252342221 |
11 | 5690668948 |
12 | 269a223639 |
13 | 1332754521 |
14 | 8da094acd |
15 | 528699db6 |
hex | 315e6b1cd |
13252342221 has 12 divisors (see below), whose sum is σ = 19143575100. Its totient is φ = 8834293440.
The previous prime is 13252342183. The next prime is 13252342223. The reversal of 13252342221 is 12224325231.
13252342221 is a `hidden beast` number, since 132 + 523 + 4 + 2 + 2 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 7137884196 + 6114458025 = 84486^2 + 78195^2 .
It is not a de Polignac number, because 13252342221 - 26 = 13252342157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13252342223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 119755 + ... + 202103.
It is an arithmetic number, because the mean of its divisors is an integer number (1595297925).
Almost surely, 213252342221 is an apocalyptic number.
It is an amenable number.
13252342221 is a deficient number, since it is larger than the sum of its proper divisors (5891232879).
13252342221 is a wasteful number, since it uses less digits than its factorization.
13252342221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100236 (or 100233 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
Adding to 13252342221 its reverse (12224325231), we get a palindrome (25476667452).
The spelling of 13252342221 in words is "thirteen billion, two hundred fifty-two million, three hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •