Base | Representation |
---|---|
bin | 1100010100011111… |
… | …1011101110111100 |
3 | 22112111001201111000 |
4 | 3011013323232330 |
5 | 23233120104403 |
6 | 1304100330300 |
7 | 144645442635 |
oct | 30507735674 |
9 | 8474051430 |
10 | 3307191228 |
11 | 14479067a0 |
12 | 7836a3990 |
13 | 40922c5b3 |
14 | 23532c88c |
15 | 1455237a3 |
hex | c51fbbbc |
3307191228 has 192 divisors, whose sum is σ = 9773568000. Its totient is φ = 958003200.
The previous prime is 3307191211. The next prime is 3307191247. The reversal of 3307191228 is 8221917033.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 3307191192 and 3307191201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3277188 + ... + 3278196.
It is an arithmetic number, because the mean of its divisors is an integer number (50904000).
Almost surely, 23307191228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3307191228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4886784000).
3307191228 is an abundant number, since it is smaller than the sum of its proper divisors (6466376772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3307191228 is a wasteful number, since it uses less digits than its factorization.
3307191228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1153 (or 1145 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 3307191228 is about 57508.1840088869. The cubic root of 3307191228 is about 1489.8862168566.
The spelling of 3307191228 in words is "three billion, three hundred seven million, one hundred ninety-one thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •