Base | Representation |
---|---|
bin | 1100000111100001001111… |
… | …0101011010011010100001 |
3 | 1202011200211011121102022201 |
4 | 3001320103311122122201 |
5 | 3221242130224233441 |
6 | 44200352130333201 |
7 | 2543402215443640 |
oct | 301702365323241 |
9 | 52150734542281 |
10 | 13323321321121 |
11 | 42774306027a9 |
12 | 15b219542a201 |
13 | 7584cb2ca806 |
14 | 340bd05b9357 |
15 | 181884476c31 |
hex | c1e13d5a6a1 |
13323321321121 has 8 divisors (see below), whose sum is σ = 15361402080384. Its totient is φ = 11318927847360.
The previous prime is 13323321321113. The next prime is 13323321321161. The reversal of 13323321321121 is 12112312332331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13323321321121 - 23 = 13323321321113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13323321321121.
It is not an unprimeable number, because it can be changed into a prime (13323321321161) 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, 8421820525 + ... + 8421822106.
It is an arithmetic number, because the mean of its divisors is an integer number (1920175260048).
Almost surely, 213323321321121 is an apocalyptic number.
It is an amenable number.
13323321321121 is a deficient number, since it is larger than the sum of its proper divisors (2038080759263).
13323321321121 is a wasteful number, since it uses less digits than its factorization.
13323321321121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16843642751.
The product of its digits is 3888, while the sum is 28.
Adding to 13323321321121 its reverse (12112312332331), we get a palindrome (25435633653452).
The spelling of 13323321321121 in words is "thirteen trillion, three hundred twenty-three billion, three hundred twenty-one million, three hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •