Base | Representation |
---|---|
bin | 1100011101100001… |
… | …1010101111111000 |
3 | 22122010100000021101 |
4 | 3013120122233320 |
5 | 23322314121000 |
6 | 1311532221144 |
7 | 145615412632 |
oct | 30730325770 |
9 | 8563300241 |
10 | 3345067000 |
11 | 1467226390 |
12 | 79430a7b4 |
13 | 4140312b2 |
14 | 23a38ba52 |
15 | 148a05e6a |
hex | c761abf8 |
3345067000 has 128 divisors (see below), whose sum is σ = 8748492480. Its totient is φ = 1186560000.
The previous prime is 3345066979. The next prime is 3345067003. The reversal of 3345067000 is 7605433.
It is a super-2 number, since 2×33450670002 = 22378946468978000000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3345067000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3345067003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 447292 + ... + 454708.
Almost surely, 23345067000 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 3345067000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4374246240).
3345067000 is an abundant number, since it is smaller than the sum of its proper divisors (5403425480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3345067000 is a wasteful number, since it uses less digits than its factorization.
3345067000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7490 (or 7476 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 28.
The square root of 3345067000 is about 57836.5541850481. The cubic root of 3345067000 is about 1495.5523065314.
The spelling of 3345067000 in words is "three billion, three hundred forty-five million, sixty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •