Base | Representation |
---|---|
bin | 11000101001001011… |
… | …11111001001110101 |
3 | 1021011001100011121212 |
4 | 30110211333021311 |
5 | 204043440413323 |
6 | 10024501251205 |
7 | 645601403015 |
oct | 142445771165 |
9 | 37131304555 |
10 | 13230404213 |
11 | 567a244564 |
12 | 2692a03b05 |
13 | 132b042c60 |
14 | 8d71c3c45 |
15 | 5267b4b78 |
hex | 31497f275 |
13230404213 has 8 divisors (see below), whose sum is σ = 14310897888. Its totient is φ = 12158877744.
The previous prime is 13230404183. The next prime is 13230404227. The reversal of 13230404213 is 31240403231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13230404213 - 28 = 13230403957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13230404233) 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 7 ways as a sum of consecutive naturals, for example, 2238731 + ... + 2244632.
It is an arithmetic number, because the mean of its divisors is an integer number (1788862236).
Almost surely, 213230404213 is an apocalyptic number.
13230404213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13230404213 is a deficient number, since it is larger than the sum of its proper divisors (1080493675).
13230404213 is a wasteful number, since it uses less digits than its factorization.
13230404213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4483603.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 13230404213 its reverse (31240403231), we get a palindrome (44470807444).
The spelling of 13230404213 in words is "thirteen billion, two hundred thirty million, four hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •