Base | Representation |
---|---|
bin | 11001100111101100111000… |
… | …01001011010110100100100 |
3 | 21101111000121221222020121221 |
4 | 30303312130021122310210 |
5 | 24341032204132031414 |
6 | 315454034205150124 |
7 | 14603260300150432 |
oct | 1463663411326444 |
9 | 241430557866557 |
10 | 56339705736484 |
11 | 16a5159812a295 |
12 | 639b01955b344 |
13 | 2558a719c41b1 |
14 | dcabdb9c7d52 |
15 | 67a7d2014224 |
hex | 333d9c25ad24 |
56339705736484 has 27 divisors (see below), whose sum is σ = 100004590187131. Its totient is φ = 27772568958680.
The previous prime is 56339705736449. The next prime is 56339705736487. The reversal of 56339705736484 is 48463750793365.
The square root of 56339705736484 is 7505978.
It is a perfect power (a square), and thus also a powerful number.
56339705736484 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56339705736487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1065822447 + ... + 1065875305.
Almost surely, 256339705736484 is an apocalyptic number.
56339705736484 is the 7505978-th square number.
It is an amenable number.
56339705736484 is a deficient number, since it is larger than the sum of its proper divisors (43664884450647).
56339705736484 is an frugal number, since it uses more digits than its factorization.
56339705736484 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105864 (or 52932 counting only the distinct ones).
The product of its (nonzero) digits is 1371686400, while the sum is 70.
The spelling of 56339705736484 in words is "fifty-six trillion, three hundred thirty-nine billion, seven hundred five million, seven hundred thirty-six thousand, four hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •