Base | Representation |
---|---|
bin | 1011011111000011… |
… | …00110000110011000 |
3 | 120220201111112201000 |
4 | 11233201212012120 |
5 | 100112001420310 |
6 | 2455503425000 |
7 | 305541342546 |
oct | 55741460630 |
9 | 16821445630 |
10 | 6166045080 |
11 | 2684631a28 |
12 | 1240bb5160 |
13 | 7735c4bb0 |
14 | 426cb2d96 |
15 | 2614d64c0 |
hex | 16f866198 |
6166045080 has 384 divisors, whose sum is σ = 22921617600. Its totient is φ = 1465620480.
The previous prime is 6166045073. The next prime is 6166045133. The reversal of 6166045080 is 805406616.
It is a super-2 number, since 2×61660450802 = 76040223857184412800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13492212 + ... + 13492668.
Almost surely, 26166045080 is an apocalyptic number.
6166045080 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 6166045080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11460808800).
6166045080 is an abundant number, since it is smaller than the sum of its proper divisors (16755572520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6166045080 is a wasteful number, since it uses less digits than its factorization.
6166045080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 552 (or 511 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 6166045080 is about 78524.1687635087. The cubic root of 6166045080 is about 1833.7307390469.
The spelling of 6166045080 in words is "six billion, one hundred sixty-six million, forty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •