Base | Representation |
---|---|
bin | 11001011111001001111011… |
… | …10101011100110110000001 |
3 | 21100102221200200101012000211 |
4 | 30233210331311130312001 |
5 | 24321224320302324312 |
6 | 315111112423314121 |
7 | 14543123516561635 |
oct | 1457447565346601 |
9 | 240387620335024 |
10 | 56046065667457 |
11 | 16949003a51298 |
12 | 6352129bab941 |
13 | 25371766b3868 |
14 | dba9033c8dc5 |
15 | 672d47d893a7 |
hex | 32f93dd5cd81 |
56046065667457 has 8 divisors (see below), whose sum is σ = 56475727526592. Its totient is φ = 55616431525200.
The previous prime is 56046065667341. The next prime is 56046065667491. The reversal of 56046065667457 is 75476656064065.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56046065667457 is a prime.
It is a super-2 number, since 2×560460656674572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56046065667392 and 56046065667401.
It is not an unprimeable number, because it can be changed into a prime (56046065677457) 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, 2860413 + ... + 10966954.
It is an arithmetic number, because the mean of its divisors is an integer number (7059465940824).
Almost surely, 256046065667457 is an apocalyptic number.
It is an amenable number.
56046065667457 is a deficient number, since it is larger than the sum of its proper divisors (429661859135).
56046065667457 is a wasteful number, since it uses less digits than its factorization.
56046065667457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13858439.
The product of its (nonzero) digits is 762048000, while the sum is 67.
The spelling of 56046065667457 in words is "fifty-six trillion, forty-six billion, sixty-five million, six hundred sixty-seven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •