Base | Representation |
---|---|
bin | 1011111010110001011011… |
… | …1011111000001000010111 |
3 | 1201101202120021211102210120 |
4 | 2332230112323320020113 |
5 | 3204200131440442010 |
6 | 43512013542523023 |
7 | 2521520341164153 |
oct | 276542673701027 |
9 | 51352507742716 |
10 | 13104330015255 |
11 | 41a25737343a6 |
12 | 1577859736473 |
13 | 74096b59625b |
14 | 334378184063 |
15 | 17ad18ad3e70 |
hex | beb16ef8217 |
13104330015255 has 8 divisors (see below), whose sum is σ = 20966928024432. Its totient is φ = 6988976008128.
The previous prime is 13104330015253. The next prime is 13104330015289. The reversal of 13104330015255 is 55251003340131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13104330015255 - 21 = 13104330015253 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104330015253) 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, 436811000494 + ... + 436811000523.
It is an arithmetic number, because the mean of its divisors is an integer number (2620866003054).
Almost surely, 213104330015255 is an apocalyptic number.
13104330015255 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13104330015255 is a deficient number, since it is larger than the sum of its proper divisors (7862598009177).
13104330015255 is an equidigital number, since it uses as much as digits as its factorization.
13104330015255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873622001025.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 13104330015255 its reverse (55251003340131), we get a palindrome (68355333355386).
The spelling of 13104330015255 in words is "thirteen trillion, one hundred four billion, three hundred thirty million, fifteen thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •