Base | Representation |
---|---|
bin | 1000000111110… |
… | …11101111100000 |
3 | 11202012212111201 |
4 | 10003323233200 |
5 | 114420440000 |
6 | 10432250544 |
7 | 1455115615 |
oct | 403735740 |
9 | 152185451 |
10 | 68140000 |
11 | 35510655 |
12 | 1a9a0a54 |
13 | 1116a036 |
14 | 909a50c |
15 | 5eae96a |
hex | 40fbbe0 |
68140000 has 60 divisors (see below), whose sum is σ = 167683824. Its totient is φ = 27248000.
The previous prime is 68139997. The next prime is 68140003. The reversal of 68140000 is 4186.
It is an interprime number because it is at equal distance from previous prime (68139997) and next prime (68140003).
It is a self number, because there is not a number n which added to its sum of digits gives 68140000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68140003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 18297 + ... + 21703.
Almost surely, 268140000 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 68140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83841912).
68140000 is an abundant number, since it is smaller than the sum of its proper divisors (99543824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68140000 is an equidigital number, since it uses as much as digits as its factorization.
68140000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3437 (or 3414 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 68140000 is about 8254.6956333956. The cubic root of 68140000 is about 408.4454317619.
Adding to 68140000 its reverse (4186), we get a palindrome (68144186).
The spelling of 68140000 in words is "sixty-eight million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •