Base | Representation |
---|---|
bin | 1100000111010110000001… |
… | …1110001110001110010011 |
3 | 1202011102001110021011201011 |
4 | 3001311200132032032103 |
5 | 3221214444400321321 |
6 | 44155133352551351 |
7 | 2543234515610305 |
oct | 301654036161623 |
9 | 52142043234634 |
10 | 13320312120211 |
11 | 4276126a285a8 |
12 | 15b16956b2557 |
13 | 75813ba44365 |
14 | 3409c6a99975 |
15 | 18175a1b6ae1 |
hex | c1d6078e393 |
13320312120211 has 8 divisors (see below), whose sum is σ = 13496195518400. Its totient is φ = 13145215673088.
The previous prime is 13320312120191. The next prime is 13320312120223. The reversal of 13320312120211 is 11202121302331.
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 13320312120211 - 227 = 13320177902483 is a prime.
It is a super-2 number, since 2×133203121202112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13320312120611) 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, 196703691 + ... + 196771396.
It is an arithmetic number, because the mean of its divisors is an integer number (1687024439800).
Almost surely, 213320312120211 is an apocalyptic number.
13320312120211 is a deficient number, since it is larger than the sum of its proper divisors (175883398189).
13320312120211 is an equidigital number, since it uses as much as digits as its factorization.
13320312120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393475533.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13320312120211 its reverse (11202121302331), we get a palindrome (24522433422542).
The spelling of 13320312120211 in words is "thirteen trillion, three hundred twenty billion, three hundred twelve million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •