Base | Representation |
---|---|
bin | 11000010001101010… |
… | …11101010111001001 |
3 | 1020122022010210002122 |
4 | 30020311131113021 |
5 | 203142440233023 |
6 | 5553133141025 |
7 | 640654543541 |
oct | 141065352711 |
9 | 36568123078 |
10 | 13033133513 |
11 | 5588956124 |
12 | 263892a775 |
13 | 12c920302a |
14 | 8b8d12321 |
15 | 5142e92c8 |
hex | 308d5d5c9 |
13033133513 has 8 divisors (see below), whose sum is σ = 13510713600. Its totient is φ = 12557430928.
The previous prime is 13033133507. The next prime is 13033133549. The reversal of 13033133513 is 31533133031.
It is a happy number.
13033133513 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 13033133513 - 214 = 13033117129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13033133213) 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, 455231 + ... + 483012.
It is an arithmetic number, because the mean of its divisors is an integer number (1688839200).
Almost surely, 213033133513 is an apocalyptic number.
It is an amenable number.
13033133513 is a deficient number, since it is larger than the sum of its proper divisors (477580087).
13033133513 is an equidigital number, since it uses as much as digits as its factorization.
13033133513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938751.
The product of its (nonzero) digits is 3645, while the sum is 26.
Adding to 13033133513 its reverse (31533133031), we get a palindrome (44566266544).
The spelling of 13033133513 in words is "thirteen billion, thirty-three million, one hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •