Base | Representation |
---|---|
bin | 1100110110001110… |
… | …11001101100110000 |
3 | 122210200122000012011 |
4 | 12123013121230300 |
5 | 103111212013143 |
6 | 3100230412304 |
7 | 332631505033 |
oct | 63307315460 |
9 | 18720560164 |
10 | 6897376048 |
11 | 2a1a430792 |
12 | 1405b01094 |
13 | 85bc84004 |
14 | 49608501a |
15 | 2a57e6e9d |
hex | 19b1d9b30 |
6897376048 has 40 divisors (see below), whose sum is σ = 14203654400. Its totient is φ = 3235443264.
The previous prime is 6897376043. The next prime is 6897376097. The reversal of 6897376048 is 8406737986.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 6897375983 and 6897376001.
It is not an unprimeable number, because it can be changed into a prime (6897376043) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 78828 + ... + 141451.
It is an arithmetic number, because the mean of its divisors is an integer number (355091360).
Almost surely, 26897376048 is an apocalyptic number.
It is an amenable number.
6897376048 is an abundant number, since it is smaller than the sum of its proper divisors (7306278352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6897376048 is a wasteful number, since it uses less digits than its factorization.
6897376048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220409 (or 220403 counting only the distinct ones).
The product of its (nonzero) digits is 12192768, while the sum is 58.
The square root of 6897376048 is about 83050.4427923175. The cubic root of 6897376048 is about 1903.5369065944.
It can be divided in two parts, 689 and 7376048, that added together give a palindrome (7376737).
The spelling of 6897376048 in words is "six billion, eight hundred ninety-seven million, three hundred seventy-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •