Base | Representation |
---|---|
bin | 1100000111110011… |
… | …1001000011001000 |
3 | 22101202220112211020 |
4 | 3001330321003020 |
5 | 23131003340000 |
6 | 1254515432440 |
7 | 143431150266 |
oct | 30174710310 |
9 | 8352815736 |
10 | 3253965000 |
11 | 141a862080 |
12 | 7698b5720 |
13 | 3cb1b48a0 |
14 | 22c235436 |
15 | 140a0cba0 |
hex | c1f390c8 |
3253965000 has 640 divisors, whose sum is σ = 12564478080. Its totient is φ = 691200000.
The previous prime is 3253964983. The next prime is 3253965047. The reversal of 3253965000 is 5693523.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 79364980 + ... + 79365020.
It is an arithmetic number, because the mean of its divisors is an integer number (19631997).
Almost surely, 23253965000 is an apocalyptic number.
3253965000 is a gapful number since it is divisible by the number (30) 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 3253965000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6282239040).
3253965000 is an abundant number, since it is smaller than the sum of its proper divisors (9310513080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3253965000 is a wasteful number, since it uses less digits than its factorization.
3253965000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 33.
The square root of 3253965000 is about 57043.5360054056. The cubic root of 3253965000 is about 1481.8501636047.
The spelling of 3253965000 in words is "three billion, two hundred fifty-three million, nine hundred sixty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •