Base | Representation |
---|---|
bin | 11001100101101011000111… |
… | …00101000010111010011101 |
3 | 21101020100210122022220221220 |
4 | 30302311203211002322131 |
5 | 24333412014010404131 |
6 | 315402033114443553 |
7 | 14565242656314333 |
oct | 1462654345027235 |
9 | 241210718286856 |
10 | 56270037200541 |
11 | 16a24a9705205a |
12 | 63896157335b9 |
13 | 255231b142b28 |
14 | dc76ad015b53 |
15 | 678aa5a79e96 |
hex | 332d63942e9d |
56270037200541 has 4 divisors (see below), whose sum is σ = 75026716267392. Its totient is φ = 37513358133692.
The previous prime is 56270037200537. The next prime is 56270037200551. The reversal of 56270037200541 is 14500273007265.
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 56270037200541 - 22 = 56270037200537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56270037200493 and 56270037200502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56270037200551) 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, 9378339533421 + ... + 9378339533426.
It is an arithmetic number, because the mean of its divisors is an integer number (18756679066848).
Almost surely, 256270037200541 is an apocalyptic number.
It is an amenable number.
56270037200541 is a deficient number, since it is larger than the sum of its proper divisors (18756679066851).
56270037200541 is a wasteful number, since it uses less digits than its factorization.
56270037200541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18756679066850.
The product of its (nonzero) digits is 352800, while the sum is 42.
The spelling of 56270037200541 in words is "fifty-six trillion, two hundred seventy billion, thirty-seven million, two hundred thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •