Base | Representation |
---|---|
bin | 1100000111010110010111… |
… | …0001101110101100011111 |
3 | 1202011102021122201211111210 |
4 | 3001311211301232230133 |
5 | 3221220140141320111 |
6 | 44155150252315503 |
7 | 2543236646236065 |
oct | 301654561565437 |
9 | 52142248654453 |
10 | 13320401120031 |
11 | 4276172196475 |
12 | 15b16bb472b93 |
13 | 758154305c85 |
14 | 3409d4826035 |
15 | 181762de70a6 |
hex | c1d65c6eb1f |
13320401120031 has 8 divisors (see below), whose sum is σ = 18061560840960. Its totient is φ = 8729754406232.
The previous prime is 13320401120023. The next prime is 13320401120063. The reversal of 13320401120031 is 13002110402331.
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 13320401120031 - 23 = 13320401120023 is a prime.
It is a super-2 number, since 2×133204011200312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320401120011) 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, 37628251575 + ... + 37628251928.
It is an arithmetic number, because the mean of its divisors is an integer number (2257695105120).
Almost surely, 213320401120031 is an apocalyptic number.
13320401120031 is a deficient number, since it is larger than the sum of its proper divisors (4741159720929).
13320401120031 is an equidigital number, since it uses as much as digits as its factorization.
13320401120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75256503565.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13320401120031 its reverse (13002110402331), we get a palindrome (26322511522362).
The spelling of 13320401120031 in words is "thirteen trillion, three hundred twenty billion, four hundred one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •