Base | Representation |
---|---|
bin | 1100000111010101101001… |
… | …1000101010100001111111 |
3 | 1202011101210100002221010002 |
4 | 3001311122120222201333 |
5 | 3221214242224444444 |
6 | 44155115304104515 |
7 | 2543232135604610 |
oct | 301653230524177 |
9 | 52141710087102 |
10 | 13320209999999 |
11 | 4276084319131 |
12 | 15b166746513b |
13 | 75812383a7b6 |
14 | 3409b72b5c07 |
15 | 181751243d4e |
hex | c1d5a62a87f |
13320209999999 has 8 divisors (see below), whose sum is σ = 15256119049248. Its totient is φ = 11392556427360.
The previous prime is 13320209999981. The next prime is 13320210000043. The reversal of 13320209999999 is 99999990202331.
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-13320209999999 is a prime.
13320209999999 is a modest number, since divided by 9999999 gives 1332020 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320209999099) 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, 2063865692 + ... + 2063872145.
It is an arithmetic number, because the mean of its divisors is an integer number (1907014881156).
Almost surely, 213320209999999 is an apocalyptic number.
13320209999999 is a deficient number, since it is larger than the sum of its proper divisors (1935909049249).
13320209999999 is an equidigital number, since it uses as much as digits as its factorization.
13320209999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4127738305.
The product of its (nonzero) digits is 172186884, while the sum is 74.
The spelling of 13320209999999 in words is "thirteen trillion, three hundred twenty billion, two hundred nine million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •