Base | Representation |
---|---|
bin | 11001011101111100010101… |
… | …11111000111001110010101 |
3 | 21100021222011122120222102201 |
4 | 30232332022333013032111 |
5 | 24320034013023414023 |
6 | 315040023154004501 |
7 | 14540120332452544 |
oct | 1456761277071625 |
9 | 240258148528381 |
10 | 56004410373013 |
11 | 16932378695013 |
12 | 6346043876731 |
13 | 253326870833b |
14 | db88b105215b |
15 | 671c0adcebad |
hex | 32ef8afc7395 |
56004410373013 has 4 divisors (see below), whose sum is σ = 56010875164128. Its totient is φ = 55997945581900.
The previous prime is 56004410372959. The next prime is 56004410373019. The reversal of 56004410373013 is 31037301440065.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 56004410373013 - 221 = 56004408275861 is a prime.
It is a super-2 number, since 2×560044103730132 (a number of 28 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 (56004410373019) 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, 3232382563 + ... + 3232399888.
It is an arithmetic number, because the mean of its divisors is an integer number (14002718791032).
Almost surely, 256004410373013 is an apocalyptic number.
It is an amenable number.
56004410373013 is a deficient number, since it is larger than the sum of its proper divisors (6464791115).
56004410373013 is an equidigital number, since it uses as much as digits as its factorization.
56004410373013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6464791114.
The product of its (nonzero) digits is 90720, while the sum is 37.
The spelling of 56004410373013 in words is "fifty-six trillion, four billion, four hundred ten million, three hundred seventy-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •