Base | Representation |
---|---|
bin | 11000100110001011… |
… | …11011011110100011 |
3 | 1021002021221211221121 |
4 | 30103011323132203 |
5 | 204021014121311 |
6 | 10022201433111 |
7 | 645144355246 |
oct | 142305733643 |
9 | 37067854847 |
10 | 13205223331 |
11 | 5667005813 |
12 | 268649b797 |
13 | 1325a67621 |
14 | 8d3b0b25d |
15 | 52448db71 |
hex | 31317b7a3 |
13205223331 has 48 divisors (see below), whose sum is σ = 14906420928. Its totient is φ = 11650867200.
The previous prime is 13205223323. The next prime is 13205223349. The reversal of 13205223331 is 13332250231.
It is not a de Polignac number, because 13205223331 - 23 = 13205223323 is a prime.
It is a super-2 number, since 2×132052233312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13205223296 and 13205223305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13205223301) 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 47 ways as a sum of consecutive naturals, for example, 136136275 + ... + 136136371.
It is an arithmetic number, because the mean of its divisors is an integer number (310550436).
Almost surely, 213205223331 is an apocalyptic number.
13205223331 is a deficient number, since it is larger than the sum of its proper divisors (1701197597).
13205223331 is an equidigital number, since it uses as much as digits as its factorization.
13205223331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332 (or 289 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 13205223331 its reverse (13332250231), we get a palindrome (26537473562).
The spelling of 13205223331 in words is "thirteen billion, two hundred five million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •