Base | Representation |
---|---|
bin | 1100000111100001010001… |
… | …0110111110101000010011 |
3 | 1202011200211210011110101221 |
4 | 3001320110112332220103 |
5 | 3221242140002321321 |
6 | 44200353043105511 |
7 | 2543402353312156 |
oct | 301702426765023 |
9 | 52150753143357 |
10 | 13323330120211 |
11 | 4277435572681 |
12 | 15b2198372297 |
13 | 75850008b887 |
14 | 340bd1829c9d |
15 | 181885113e41 |
hex | c1e145bea13 |
13323330120211 has 8 divisors (see below), whose sum is σ = 13782800883600. Its totient is φ = 12863862396000.
The previous prime is 13323330120209. The next prime is 13323330120313. The reversal of 13323330120211 is 11202103332331.
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 13323330120211 - 21 = 13323330120209 is a prime.
It is a super-2 number, since 2×133233301202112 (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 (13323330120811) 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, 11527000 + ... + 12630058.
It is an arithmetic number, because the mean of its divisors is an integer number (1722850110450).
Almost surely, 213323330120211 is an apocalyptic number.
13323330120211 is a deficient number, since it is larger than the sum of its proper divisors (459470763389).
13323330120211 is a wasteful number, since it uses less digits than its factorization.
13323330120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519589.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13323330120211 its reverse (11202103332331), we get a palindrome (24525433452542).
The spelling of 13323330120211 in words is "thirteen trillion, three hundred twenty-three billion, three hundred thirty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.327 sec. • engine limits •