Base | Representation |
---|---|
bin | 1011111100011101101111… |
… | …0100101001001110000101 |
3 | 1201111112121102211211122011 |
4 | 2333013123310221032011 |
5 | 3210134202134101001 |
6 | 43533222502334221 |
7 | 2523566653602211 |
oct | 277073364511605 |
9 | 51445542754564 |
10 | 13133403034501 |
11 | 4203932698032 |
12 | 158141212a371 |
13 | 7436228a9019 |
14 | 33593544b941 |
15 | 17b96b151d51 |
hex | bf1dbd29385 |
13133403034501 has 4 divisors (see below), whose sum is σ = 13135777547904. Its totient is φ = 13131028521100.
The previous prime is 13133403034489. The next prime is 13133403034517. The reversal of 13133403034501 is 10543030433131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13133403034501 - 217 = 13133402903429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133403094501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1187248405 + ... + 1187259466.
It is an arithmetic number, because the mean of its divisors is an integer number (3283944386976).
Almost surely, 213133403034501 is an apocalyptic number.
It is an amenable number.
13133403034501 is a deficient number, since it is larger than the sum of its proper divisors (2374513403).
13133403034501 is an equidigital number, since it uses as much as digits as its factorization.
13133403034501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2374513402.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 13133403034501 its reverse (10543030433131), we get a palindrome (23676433467632).
The spelling of 13133403034501 in words is "thirteen trillion, one hundred thirty-three billion, four hundred three million, thirty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •