Base | Representation |
---|---|
bin | 1011110101010101110011… |
… | …0100111111000011100101 |
3 | 1201001211200220000211020220 |
4 | 2331111130310333003211 |
5 | 3201133023403130341 |
6 | 43401102122314553 |
7 | 2512005016365531 |
oct | 275253464770345 |
9 | 51054626024226 |
10 | 13011013333221 |
11 | 4166a37914a82 |
12 | 1561756058a59 |
13 | 734c195a0837 |
14 | 32da449a6bc1 |
15 | 1786a64aba66 |
hex | bd55cd3f0e5 |
13011013333221 has 8 divisors (see below), whose sum is σ = 17348263563840. Its totient is φ = 8673885995712.
The previous prime is 13011013333127. The next prime is 13011013333223. The reversal of 13011013333221 is 12233331011031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13011013333221 - 27 = 13011013333093 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13011013333191 and 13011013333200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011013333223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30475956 + ... + 30899933.
It is an arithmetic number, because the mean of its divisors is an integer number (2168532945480).
Almost surely, 213011013333221 is an apocalyptic number.
It is an amenable number.
13011013333221 is a deficient number, since it is larger than the sum of its proper divisors (4337250230619).
13011013333221 is an equidigital number, since it uses as much as digits as its factorization.
13011013333221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61446555.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13011013333221 its reverse (12233331011031), we get a palindrome (25244344344252).
The spelling of 13011013333221 in words is "thirteen trillion, eleven billion, thirteen million, three hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •