Base | Representation |
---|---|
bin | 1100000111111110010101… |
… | …1000111001110101101111 |
3 | 1202012102222111211120001120 |
4 | 3001333211120321311233 |
5 | 3221404124244432234 |
6 | 44204123145112023 |
7 | 2544066610411605 |
oct | 301774530716557 |
9 | 52172874746046 |
10 | 13331132030319 |
11 | 427a779542174 |
12 | 15b37b5188613 |
13 | 759174565c2c |
14 | 341331a8b875 |
15 | 181b90031049 |
hex | c1fe5639d6f |
13331132030319 has 4 divisors (see below), whose sum is σ = 17774842707096. Its totient is φ = 8887421353544.
The previous prime is 13331132030299. The next prime is 13331132030351. The reversal of 13331132030319 is 91303023113331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13331132030319 - 28 = 13331132030063 is a prime.
It is a super-2 number, since 2×133311320303192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13331132030319.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331130030319) 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, 2221855338384 + ... + 2221855338389.
It is an arithmetic number, because the mean of its divisors is an integer number (4443710676774).
Almost surely, 213331132030319 is an apocalyptic number.
13331132030319 is a deficient number, since it is larger than the sum of its proper divisors (4443710676777).
13331132030319 is an equidigital number, since it uses as much as digits as its factorization.
13331132030319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4443710676776.
The product of its (nonzero) digits is 13122, while the sum is 33.
The spelling of 13331132030319 in words is "thirteen trillion, three hundred thirty-one billion, one hundred thirty-two million, thirty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •