Base | Representation |
---|---|
bin | 10000110000001… |
… | …01000101010000 |
3 | 100210102122220211 |
4 | 20120011011100 |
5 | 241433430000 |
6 | 21540013504 |
7 | 3324325312 |
oct | 1030050520 |
9 | 323378824 |
10 | 140530000 |
11 | 723642a6 |
12 | 3b091294 |
13 | 23164660 |
14 | 149417b2 |
15 | c50d7ba |
hex | 8605150 |
140530000 has 200 divisors, whose sum is σ = 390475008. Its totient is φ = 48576000.
The previous prime is 140529979. The next prime is 140530051. The reversal of 140530000 is 35041.
140530000 = T2665 + T2666 + ... + T2703.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2989977 + ... + 2990023.
Almost surely, 2140530000 is an apocalyptic number.
140530000 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 140530000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195237504).
140530000 is an abundant number, since it is smaller than the sum of its proper divisors (249945008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140530000 is a wasteful number, since it uses less digits than its factorization.
140530000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111 (or 90 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 13.
The square root of 140530000 is about 11854.5349972068. The cubic root of 140530000 is about 519.9038283684.
Adding to 140530000 its reverse (35041), we get a palindrome (140565041).
The spelling of 140530000 in words is "one hundred forty million, five hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •