Base | Representation |
---|---|
bin | 1100000111010101101111… |
… | …0001010000100010010101 |
3 | 1202011101211221210211220220 |
4 | 3001311123301100202111 |
5 | 3221214314201134331 |
6 | 44155121453544553 |
7 | 2543232540163221 |
oct | 301653361204225 |
9 | 52141757724826 |
10 | 13320233224341 |
11 | 42760964409aa |
12 | 15b16731a5159 |
13 | 7581285ac704 |
14 | 3409ba3dd781 |
15 | 1817532d0296 |
hex | c1d5bc50895 |
13320233224341 has 8 divisors (see below), whose sum is σ = 17760329556000. Its totient is φ = 8880146187792.
The previous prime is 13320233224301. The next prime is 13320233224387. The reversal of 13320233224341 is 14342233202331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13320233224341 - 27 = 13320233224213 is a prime.
It is a super-2 number, since 2×133202332243412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320233224301) 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, 2380410 + ... + 5683908.
It is an arithmetic number, because the mean of its divisors is an integer number (2220041194500).
Almost surely, 213320233224341 is an apocalyptic number.
It is an amenable number.
13320233224341 is a deficient number, since it is larger than the sum of its proper divisors (4440096331659).
13320233224341 is a wasteful number, since it uses less digits than its factorization.
13320233224341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4647555.
The product of its (nonzero) digits is 62208, while the sum is 33.
Adding to 13320233224341 its reverse (14342233202331), we get a palindrome (27662466426672).
The spelling of 13320233224341 in words is "thirteen trillion, three hundred twenty billion, two hundred thirty-three million, two hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •