Base | Representation |
---|---|
bin | 1100000110010010010011… |
… | …1011100100101001100101 |
3 | 1202002200010112122001001220 |
4 | 3001210210323210221211 |
5 | 3220420232111441401 |
6 | 44142525442010553 |
7 | 2542022156362614 |
oct | 301444473445145 |
9 | 52080115561056 |
10 | 13302133312101 |
11 | 4269448517a47 |
12 | 15aa061646a59 |
13 | 75650276957a |
14 | 33db8060587b |
15 | 18104428d336 |
hex | c1924ee4a65 |
13302133312101 has 4 divisors (see below), whose sum is σ = 17736177749472. Its totient is φ = 8868088874732.
The previous prime is 13302133312099. The next prime is 13302133312133. The reversal of 13302133312101 is 10121333120331.
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 13302133312101 - 21 = 13302133312099 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13302133312301) 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, 2217022218681 + ... + 2217022218686.
It is an arithmetic number, because the mean of its divisors is an integer number (4434044437368).
Almost surely, 213302133312101 is an apocalyptic number.
It is an amenable number.
13302133312101 is a deficient number, since it is larger than the sum of its proper divisors (4434044437371).
13302133312101 is an equidigital number, since it uses as much as digits as its factorization.
13302133312101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4434044437370.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13302133312101 its reverse (10121333120331), we get a palindrome (23423466432432).
The spelling of 13302133312101 in words is "thirteen trillion, three hundred two billion, one hundred thirty-three million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •