Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0111010101101101110111 |
3 | 1201101202120111111002120021 |
4 | 2332230113013111231313 |
5 | 3204200133223120043 |
6 | 43512014131150011 |
7 | 2521520405550340 |
oct | 276542707255567 |
9 | 51352514432507 |
10 | 13104333020023 |
11 | 41a25753a6983 |
12 | 157785a745307 |
13 | 74096c0a8b1b |
14 | 3343787270c7 |
15 | 17ad18ec93ed |
hex | beb171d5b77 |
13104333020023 has 4 divisors (see below), whose sum is σ = 14976380594320. Its totient is φ = 11232285445728.
The previous prime is 13104333019961. The next prime is 13104333020039. The reversal of 13104333020023 is 32002033340131.
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 13104333020023 - 225 = 13104299465591 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 13104333020023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104334020023) 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, 936023787138 + ... + 936023787151.
It is an arithmetic number, because the mean of its divisors is an integer number (3744095148580).
Almost surely, 213104333020023 is an apocalyptic number.
13104333020023 is a deficient number, since it is larger than the sum of its proper divisors (1872047574297).
13104333020023 is an equidigital number, since it uses as much as digits as its factorization.
13104333020023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1872047574296.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13104333020023 its reverse (32002033340131), we get a palindrome (45106366360154).
The spelling of 13104333020023 in words is "thirteen trillion, one hundred four billion, three hundred thirty-three million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •