Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …01000110011100010111001 |
3 | 21100021112210022122112012100 |
4 | 30232322010020303202321 |
5 | 24320001000112143131 |
6 | 315034013423134013 |
7 | 14536603134300534 |
oct | 1456720410634271 |
9 | 240245708575170 |
10 | 56000000506041 |
11 | 16930515406759 |
12 | 6345212a44309 |
13 | 2532a14bcc1b7 |
14 | db85b34c9a1b |
15 | 671a4db977e6 |
hex | 32ee842338b9 |
56000000506041 has 12 divisors (see below), whose sum is σ = 82214936991460. Its totient is φ = 36721311806880.
The previous prime is 56000000506033. The next prime is 56000000506103. The reversal of 56000000506041 is 14060500000065.
It is a happy number.
56000000506041 is a `hidden beast` number, since 5 + 6 + 0 + 0 + 0 + 0 + 0 + 0 + 50 + 604 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 11427753206016 + 44572247300025 = 3380496^2 + 6676245^2 .
It is not a de Polignac number, because 56000000506041 - 23 = 56000000506033 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56000000505996 and 56000000506014.
It is not an unprimeable number, because it can be changed into a prime (56000000506441) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51001821406 + ... + 51001822503.
Almost surely, 256000000506041 is an apocalyptic number.
It is an amenable number.
56000000506041 is a deficient number, since it is larger than the sum of its proper divisors (26214936485419).
56000000506041 is a wasteful number, since it uses less digits than its factorization.
56000000506041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102003643976 (or 102003643973 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 56000000506041 in words is "fifty-six trillion, five hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •