Base | Representation |
---|---|
bin | 1100000111111111000000… |
… | …1000101010100111000101 |
3 | 1202012110110002002101010202 |
4 | 3001333300020222213011 |
5 | 3221410011423314023 |
6 | 44204153105300245 |
7 | 2544104230026356 |
oct | 301776010524705 |
9 | 52173402071122 |
10 | 13331312323013 |
11 | 427a8612947a3 |
12 | 15b3845634685 |
13 | 7591a2a100b9 |
14 | 34134b9bdd2d |
15 | 181ba0c96128 |
hex | c1ff022a9c5 |
13331312323013 has 4 divisors (see below), whose sum is σ = 13390040571360. Its totient is φ = 13272584074668.
The previous prime is 13331312322917. The next prime is 13331312323033. The reversal of 13331312323013 is 31032321313331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13331312323013 - 222 = 13331308128709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331312323033) 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, 29364123833 + ... + 29364124286.
It is an arithmetic number, because the mean of its divisors is an integer number (3347510142840).
Almost surely, 213331312323013 is an apocalyptic number.
It is an amenable number.
13331312323013 is a deficient number, since it is larger than the sum of its proper divisors (58728248347).
13331312323013 is an equidigital number, since it uses as much as digits as its factorization.
13331312323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58728248346.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 13331312323013 its reverse (31032321313331), we get a palindrome (44363633636344).
The spelling of 13331312323013 in words is "thirteen trillion, three hundred thirty-one billion, three hundred twelve million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •