Base | Representation |
---|---|
bin | 1100011001001110… |
… | …00011001001011000 |
3 | 122011201200221021110 |
4 | 12030213003021120 |
5 | 102111411422130 |
6 | 3020134340320 |
7 | 323615120562 |
oct | 61447031130 |
9 | 18151627243 |
10 | 6654014040 |
11 | 2905021263 |
12 | 13584ba6a0 |
13 | 820726b1b |
14 | 471a16332 |
15 | 28e274ab0 |
hex | 18c9c3258 |
6654014040 has 128 divisors (see below), whose sum is σ = 20834366400. Its totient is φ = 1697955840.
The previous prime is 6654013987. The next prime is 6654014063. The reversal of 6654014040 is 404104566.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 6654013989 and 6654014007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 384780 + ... + 401700.
Almost surely, 26654014040 is an apocalyptic number.
6654014040 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6654014040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10417183200).
6654014040 is an abundant number, since it is smaller than the sum of its proper divisors (14180352360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6654014040 is a wasteful number, since it uses less digits than its factorization.
6654014040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17077 (or 17073 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The square root of 6654014040 is about 81572.1400969718. The cubic root of 6654014040 is about 1880.8806459641.
The spelling of 6654014040 in words is "six billion, six hundred fifty-four million, fourteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •