Base | Representation |
---|---|
bin | 1000000111100… |
… | …10000101100010 |
3 | 11202010212020220 |
4 | 10003302011202 |
5 | 114413203300 |
6 | 10431343510 |
7 | 1454562405 |
oct | 403620542 |
9 | 152125226 |
10 | 68100450 |
11 | 35493970 |
12 | 1a981b96 |
13 | 11155032 |
14 | 9089d3c |
15 | 5ea2da0 |
hex | 40f2162 |
68100450 has 96 divisors (see below), whose sum is σ = 186148800. Its totient is φ = 16339200.
The previous prime is 68100443. The next prime is 68100457. The reversal of 68100450 is 5400186.
It is an interprime number because it is at equal distance from previous prime (68100443) and next prime (68100457).
It is a self number, because there is not a number n which added to its sum of digits gives 68100450.
It is not an unprimeable number, because it can be changed into a prime (68100457) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 245712 + ... + 245988.
It is an arithmetic number, because the mean of its divisors is an integer number (1939050).
Almost surely, 268100450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68100450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93074400).
68100450 is an abundant number, since it is smaller than the sum of its proper divisors (118048350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68100450 is a wasteful number, since it uses less digits than its factorization.
68100450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452 (or 447 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 68100450 is about 8252.2996794833. The cubic root of 68100450 is about 408.3663928067.
The spelling of 68100450 in words is "sixty-eight million, one hundred thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •