Base | Representation |
---|---|
bin | 1100010110100001… |
… | …10011000111000000 |
3 | 122010011011020002101 |
4 | 12023100303013000 |
5 | 102040114411333 |
6 | 3014010000144 |
7 | 323222001160 |
oct | 61320630700 |
9 | 18104136071 |
10 | 6631403968 |
11 | 28a3288a52 |
12 | 1350a16054 |
13 | 818b3b697 |
14 | 46ca0c5a0 |
15 | 28c2aa67d |
hex | 18b4331c0 |
6631403968 has 28 divisors (see below), whose sum is σ = 15039077872. Its totient is φ = 2842030080.
The previous prime is 6631403941. The next prime is 6631403969. The reversal of 6631403968 is 8693041366.
It is a tau number, because it is divible by the number of its divisors (28).
It is a super-2 number, since 2×66314039682 = 87951037173612290048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6631403969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7400673 + ... + 7401568.
It is an arithmetic number, because the mean of its divisors is an integer number (537109924).
Almost surely, 26631403968 is an apocalyptic number.
It is an amenable number.
6631403968 is an abundant number, since it is smaller than the sum of its proper divisors (8407673904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6631403968 is a wasteful number, since it uses less digits than its factorization.
6631403968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14802260 (or 14802250 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 46.
The square root of 6631403968 is about 81433.4327411046. The cubic root of 6631403968 is about 1878.7478428230.
The spelling of 6631403968 in words is "six billion, six hundred thirty-one million, four hundred three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •