Base | Representation |
---|---|
bin | 1110000011100010110101… |
… | …0110111101000100000101 |
3 | 2000201101121112210001201210 |
4 | 3200320231112331010011 |
5 | 4011144400122314023 |
6 | 52511254420042033 |
7 | 3153342563564454 |
oct | 340705526750405 |
9 | 60641545701653 |
10 | 15454053323013 |
11 | 4a1903323a558 |
12 | 1897123233319 |
13 | 88140729c006 |
14 | 3b5da183cb9b |
15 | 1bbede6ac593 |
hex | e0e2d5bd105 |
15454053323013 has 8 divisors (see below), whose sum is σ = 21689899400800. Its totient is φ = 9760454730288.
The previous prime is 15454053322979. The next prime is 15454053323029. The reversal of 15454053323013 is 31032335045451.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 15454053323013 - 212 = 15454053318917 is a prime.
It is a super-2 number, since 2×154540533230132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15454053323713) 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, 135561871198 + ... + 135561871311.
It is an arithmetic number, because the mean of its divisors is an integer number (2711237425100).
Almost surely, 215454053323013 is an apocalyptic number.
It is an amenable number.
15454053323013 is a deficient number, since it is larger than the sum of its proper divisors (6235846077787).
15454053323013 is a wasteful number, since it uses less digits than its factorization.
15454053323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271123742531.
The product of its (nonzero) digits is 324000, while the sum is 39.
Adding to 15454053323013 its reverse (31032335045451), we get a palindrome (46486388368464).
The spelling of 15454053323013 in words is "fifteen trillion, four hundred fifty-four billion, fifty-three million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •