Base | Representation |
---|---|
bin | 1100000111111110010101… |
… | …0101011100010100111001 |
3 | 1202012102222110010110110012 |
4 | 3001333211111130110321 |
5 | 3221404124031414001 |
6 | 44204123113431305 |
7 | 2544066566612426 |
oct | 301774525342471 |
9 | 52172873113405 |
10 | 13331131123001 |
11 | 427a778a8251a |
12 | 15b37b4a0b535 |
13 | 759174308c63 |
14 | 3413318d2d4d |
15 | 181b8ee022bb |
hex | c1fe555c539 |
13331131123001 has 4 divisors (see below), whose sum is σ = 13334283440100. Its totient is φ = 13327978805904.
The previous prime is 13331131122997. The next prime is 13331131123007. The reversal of 13331131123001 is 10032113113331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13000178291776 + 330952831225 = 3605576^2 + 575285^2 .
It is a cyclic number.
It is not a de Polignac number, because 13331131123001 - 22 = 13331131122997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13331131123007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1576152206 + ... + 1576160663.
It is an arithmetic number, because the mean of its divisors is an integer number (3333570860025).
Almost surely, 213331131123001 is an apocalyptic number.
It is an amenable number.
13331131123001 is a deficient number, since it is larger than the sum of its proper divisors (3152317099).
13331131123001 is an equidigital number, since it uses as much as digits as its factorization.
13331131123001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3152317098.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13331131123001 its reverse (10032113113331), we get a palindrome (23363244236332).
The spelling of 13331131123001 in words is "thirteen trillion, three hundred thirty-one billion, one hundred thirty-one million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •