Base | Representation |
---|---|
bin | 1100000000011010101111… |
… | …1111010100010110111001 |
3 | 1201202000220200121022110221 |
4 | 3000012223333110112321 |
5 | 3212242300410044001 |
6 | 44024334102540041 |
7 | 2531523005366554 |
oct | 300065377242671 |
9 | 51660820538427 |
10 | 13201320003001 |
11 | 422a714a90769 |
12 | 1592607437621 |
13 | 749b575c7150 |
14 | 338d3955369b |
15 | 17d5e394d1a1 |
hex | c01abfd45b9 |
13201320003001 has 8 divisors (see below), whose sum is σ = 14216834488640. Its totient is φ = 12185809564752.
The previous prime is 13201320002989. The next prime is 13201320003103. The reversal of 13201320003001 is 10030002310231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13201320003001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13201320003301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11415436 + ... + 12518578.
It is an arithmetic number, because the mean of its divisors is an integer number (1777104311080).
Almost surely, 213201320003001 is an apocalyptic number.
It is an amenable number.
13201320003001 is a deficient number, since it is larger than the sum of its proper divisors (1015514485639).
13201320003001 is a wasteful number, since it uses less digits than its factorization.
13201320003001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2023695.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13201320003001 its reverse (10030002310231), we get a palindrome (23231322313232).
The spelling of 13201320003001 in words is "thirteen trillion, two hundred one billion, three hundred twenty million, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •