Base | Representation |
---|---|
bin | 11000100110110001… |
… | …11011010100101001 |
3 | 1021002122022212100211 |
4 | 30103120323110221 |
5 | 204023303002213 |
6 | 10022500301121 |
7 | 645234606430 |
oct | 142330732451 |
9 | 37078285324 |
10 | 13210203433 |
11 | 56698a73a9 |
12 | 26880a17a1 |
13 | 1326abc32b |
14 | 8d4646117 |
15 | 524b2453d |
hex | 31363b529 |
13210203433 has 8 divisors (see below), whose sum is σ = 15753783168. Its totient is φ = 10830725664.
The previous prime is 13210203373. The next prime is 13210203463. The reversal of 13210203433 is 33430201231.
13210203433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13210203433 - 29 = 13210202921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13210203463) 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, 41025316 + ... + 41025637.
It is an arithmetic number, because the mean of its divisors is an integer number (1969222896).
Almost surely, 213210203433 is an apocalyptic number.
It is an amenable number.
13210203433 is a deficient number, since it is larger than the sum of its proper divisors (2543579735).
13210203433 is an equidigital number, since it uses as much as digits as its factorization.
13210203433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82050983.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 13210203433 its reverse (33430201231), we get a palindrome (46640404664).
The spelling of 13210203433 in words is "thirteen billion, two hundred ten million, two hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •