Base | Representation |
---|---|
bin | 1011111011101100001100… |
… | …0001111111011111010111 |
3 | 1201110021021110222111121101 |
4 | 2332323003001333133113 |
5 | 3204424432130420203 |
6 | 43523143003330531 |
7 | 2522616235434646 |
oct | 276730301773727 |
9 | 51407243874541 |
10 | 13120102201303 |
11 | 41a922771a1a9 |
12 | 157a91b820a47 |
13 | 7422b30a7216 |
14 | 335032b7335d |
15 | 17b43d5c941d |
hex | beec307f7d7 |
13120102201303 has 8 divisors (see below), whose sum is σ = 13123444728320. Its totient is φ = 13116759909120.
The previous prime is 13120102201301. The next prime is 13120102201307. The reversal of 13120102201303 is 30310220102131.
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 13120102201303 - 21 = 13120102201301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120102201301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173989738 + ... + 174065128.
It is an arithmetic number, because the mean of its divisors is an integer number (1640430591040).
Almost surely, 213120102201303 is an apocalyptic number.
13120102201303 is a deficient number, since it is larger than the sum of its proper divisors (3342527017).
13120102201303 is an equidigital number, since it uses as much as digits as its factorization.
13120102201303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117417.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13120102201303 its reverse (30310220102131), we get a palindrome (43430322303434).
The spelling of 13120102201303 in words is "thirteen trillion, one hundred twenty billion, one hundred two million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •