Base | Representation |
---|---|
bin | 1100001010110011… |
… | …0111001000011100 |
3 | 22102122120102120012 |
4 | 3002230313020130 |
5 | 23142213240220 |
6 | 1300045142352 |
7 | 143643063260 |
oct | 30254671034 |
9 | 8378512505 |
10 | 3266540060 |
11 | 1426970993 |
12 | 771b5a9b8 |
13 | 400998554 |
14 | 22db8a0a0 |
15 | 141b93ac5 |
hex | c2b3721c |
3266540060 has 96 divisors (see below), whose sum is σ = 8111480832. Its totient is φ = 1081301760.
The previous prime is 3266540051. The next prime is 3266540071. The reversal of 3266540060 is 600456623.
It is a junction number, because it is equal to n+sod(n) for n = 3266539999 and 3266540026.
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, 3224114 + ... + 3225126.
It is an arithmetic number, because the mean of its divisors is an integer number (84494592).
Almost surely, 23266540060 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 3266540060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4055740416).
3266540060 is an abundant number, since it is smaller than the sum of its proper divisors (4844940772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3266540060 is a wasteful number, since it uses less digits than its factorization.
3266540060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1803 (or 1801 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
The square root of 3266540060 is about 57153.6530765969. The cubic root of 3266540060 is about 1483.7565969102.
Adding to 3266540060 its reverse (600456623), we get a palindrome (3866996683).
The spelling of 3266540060 in words is "three billion, two hundred sixty-six million, five hundred forty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •