Base | Representation |
---|---|
bin | 10000101100100… |
… | …01000111011000 |
3 | 100202112112100020 |
4 | 20112101013120 |
5 | 241323230000 |
6 | 21521510440 |
7 | 3320306421 |
oct | 1026210730 |
9 | 322475306 |
10 | 140055000 |
11 | 7206a438 |
12 | 3aaa2420 |
13 | 230293a7 |
14 | 1485a648 |
15 | c467ba0 |
hex | 85911d8 |
140055000 has 80 divisors (see below), whose sum is σ = 437578680. Its totient is φ = 37344000.
The previous prime is 140054989. The next prime is 140055001. The reversal of 140055000 is 550041.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140055001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 10332 + ... + 19668.
Almost surely, 2140055000 is an apocalyptic number.
140055000 is a gapful number since it is divisible by the number (10) 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 140055000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218789340).
140055000 is an abundant number, since it is smaller than the sum of its proper divisors (297523680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140055000 is an equidigital number, since it uses as much as digits as its factorization.
140055000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9366 (or 9347 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 140055000 is about 11834.4835121775. The cubic root of 140055000 is about 519.3173982293.
The spelling of 140055000 in words is "one hundred forty million, fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •