Base | Representation |
---|---|
bin | 1100000111111110001110… |
… | …1010100010110001110111 |
3 | 1202012102220111101202011010 |
4 | 3001333203222202301313 |
5 | 3221404044343200043 |
6 | 44204120233043303 |
7 | 2544066106456662 |
oct | 301774352426167 |
9 | 52172814352133 |
10 | 13331103100023 |
11 | 427a764182435 |
12 | 15b37a7556533 |
13 | 75916b576b07 |
14 | 34132bcba6d9 |
15 | 181b8c719133 |
hex | c1fe3aa2c77 |
13331103100023 has 8 divisors (see below), whose sum is σ = 17777178252288. Its totient is φ = 8886215007224.
The previous prime is 13331103099989. The next prime is 13331103100037. The reversal of 13331103100023 is 32000130113331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13331103100023 - 220 = 13331102051447 is a prime.
It is a super-3 number, since 3×133311031000233 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331103100723) 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, 296738661 + ... + 296783582.
It is an arithmetic number, because the mean of its divisors is an integer number (2222147281536).
Almost surely, 213331103100023 is an apocalyptic number.
13331103100023 is a deficient number, since it is larger than the sum of its proper divisors (4446075152265).
13331103100023 is an equidigital number, since it uses as much as digits as its factorization.
13331103100023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593529733.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13331103100023 its reverse (32000130113331), we get a palindrome (45331233213354).
The spelling of 13331103100023 in words is "thirteen trillion, three hundred thirty-one billion, one hundred three million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •