Base | Representation |
---|---|
bin | 11000100111111110… |
… | …00111001000110101 |
3 | 1021010100011102022200 |
4 | 30103333013020311 |
5 | 204033333311201 |
6 | 10023455015113 |
7 | 645415646631 |
oct | 142377071065 |
9 | 37110142280 |
10 | 13220213301 |
11 | 5674513a19 |
12 | 268b50a499 |
13 | 1328bb5529 |
14 | 8d5acddc1 |
15 | 525950386 |
hex | 313fc7235 |
13220213301 has 12 divisors (see below), whose sum is σ = 19284932940. Its totient is φ = 8726212800.
The previous prime is 13220213299. The next prime is 13220213333. The reversal of 13220213301 is 10331202231.
13220213301 is a `hidden beast` number, since 132 + 20 + 213 + 301 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 12023122500 + 1197090801 = 109650^2 + 34599^2 .
It is not a de Polignac number, because 13220213301 - 21 = 13220213299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13220213341) 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, 7270936 + ... + 7272753.
It is an arithmetic number, because the mean of its divisors is an integer number (1607077745).
Almost surely, 213220213301 is an apocalyptic number.
It is an amenable number.
13220213301 is a deficient number, since it is larger than the sum of its proper divisors (6064719639).
13220213301 is a wasteful number, since it uses less digits than its factorization.
13220213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14543796 (or 14543793 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 13220213301 its reverse (10331202231), we get a palindrome (23551415532).
The spelling of 13220213301 in words is "thirteen billion, two hundred twenty million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •