Base | Representation |
---|---|
bin | 1100000110001011001010… |
… | …0011101000010101110101 |
3 | 1202002111011210220212222210 |
4 | 3001202302203220111311 |
5 | 3220402314343330031 |
6 | 44142011213444033 |
7 | 2541623466233406 |
oct | 301426243502565 |
9 | 52074153825883 |
10 | 13300214433141 |
11 | 4268653347869 |
12 | 15a9806aa0619 |
13 | 75628805592c |
14 | 33da3b8259ad |
15 | 180e80aa1746 |
hex | c18b28e8575 |
13300214433141 has 8 divisors (see below), whose sum is σ = 17736158813760. Its totient is φ = 8865539837312.
The previous prime is 13300214433097. The next prime is 13300214433151. The reversal of 13300214433141 is 14133441200331.
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 13300214433141 - 213 = 13300214424949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13300214433099 and 13300214433108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300214433151) 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, 317421756 + ... + 317463653.
It is an arithmetic number, because the mean of its divisors is an integer number (2217019851720).
Almost surely, 213300214433141 is an apocalyptic number.
It is an amenable number.
13300214433141 is a deficient number, since it is larger than the sum of its proper divisors (4435944380619).
13300214433141 is an equidigital number, since it uses as much as digits as its factorization.
13300214433141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 634892395.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 13300214433141 its reverse (14133441200331), we get a palindrome (27433655633472).
The spelling of 13300214433141 in words is "thirteen trillion, three hundred billion, two hundred fourteen million, four hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •