Base | Representation |
---|---|
bin | 110010001111000001001… |
… | …0000000000000000000000 |
3 | 220110000221101222201112011 |
4 | 1210132002100000000000 |
5 | 1401104244101131211 |
6 | 22403424501142304 |
7 | 1311545311646221 |
oct | 144360220000000 |
9 | 26400841881464 |
10 | 6904197677056 |
11 | 2222065662139 |
12 | 9360b59ba994 |
13 | 3b10a8690484 |
14 | 19c2448a5248 |
15 | be8d9c85921 |
hex | 64782400000 |
6904197677056 has 69 divisors (see below), whose sum is σ = 13819164679411. Its totient is φ = 3449408192512.
The previous prime is 6904197677051. The next prime is 6904197677059. The reversal of 6904197677056 is 6507767914096.
The square root of 6904197677056 is 2627584.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6904197676982 and 6904197677000.
It is not an unprimeable number, because it can be changed into a prime (6904197677051) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5381291391 + ... + 5381292673.
Almost surely, 26904197677056 is an apocalyptic number.
6904197677056 is the 2627584-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6904197677056
6904197677056 is an abundant number, since it is smaller than the sum of its proper divisors (6914967002355).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6904197677056 is an frugal number, since it uses more digits than its factorization.
6904197677056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2610 (or 1285 counting only the distinct ones).
The product of its (nonzero) digits is 120022560, while the sum is 67.
The spelling of 6904197677056 in words is "six trillion, nine hundred four billion, one hundred ninety-seven million, six hundred seventy-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •