Base | Representation |
---|---|
bin | 101001011001101000111… |
… | …0100001110001001000000 |
3 | 202010222000211210000122100 |
4 | 1102303101310032021000 |
5 | 1221211214021434311 |
6 | 20033550453110400 |
7 | 1125043625005341 |
oct | 122632164161100 |
9 | 22128024700570 |
10 | 5690056827456 |
11 | 18a4159815491 |
12 | 77a930628400 |
13 | 32375454c951 |
14 | 1595862bc0c8 |
15 | 9d0288e3a56 |
hex | 52cd1d0e240 |
5690056827456 has 63 divisors (see below), whose sum is σ = 16309684620723. Its totient is φ = 1896666526080.
The previous prime is 5690056827443. The next prime is 5690056827517. The reversal of 5690056827456 is 6547286500965.
It is a happy number.
The square root of 5690056827456 is 2385384.
It is a perfect power (a square), and thus also a powerful number.
5690056827456 is a `hidden beast` number, since 5 + 6 + 9 + 0 + 0 + 568 + 27 + 45 + 6 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5690056827393 and 5690056827402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 57199521 + ... + 57298911.
Almost surely, 25690056827456 is an apocalyptic number.
5690056827456 is the 2385384-th square number.
It is an amenable number.
5690056827456 is an abundant number, since it is smaller than the sum of its proper divisors (10619627793267).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5690056827456 is an frugal number, since it uses more digits than its factorization.
5690056827456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198800 (or 99396 counting only the distinct ones).
The product of its (nonzero) digits is 108864000, while the sum is 63.
The spelling of 5690056827456 in words is "five trillion, six hundred ninety billion, fifty-six million, eight hundred twenty-seven thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •