Base | Representation |
---|---|
bin | 10000110000101… |
… | …00001110000000 |
3 | 100210112210222010 |
4 | 20120110032000 |
5 | 241442421000 |
6 | 21541212520 |
7 | 3325004133 |
oct | 1030241600 |
9 | 323483863 |
10 | 140592000 |
11 | 723a693a |
12 | 3b101140 |
13 | 23186943 |
14 | 1495a21a |
15 | c521d50 |
hex | 8614380 |
140592000 has 256 divisors, whose sum is σ = 486907200. Its totient is φ = 35840000.
The previous prime is 140591981. The next prime is 140592017. The reversal of 140592000 is 295041.
140592000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1405920002 = 39532220928000000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1391950 + ... + 1392050.
Almost surely, 2140592000 is an apocalyptic number.
140592000 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 140592000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (243453600).
140592000 is an abundant number, since it is smaller than the sum of its proper divisors (346315200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140592000 is a wasteful number, since it uses less digits than its factorization.
140592000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 140592000 is about 11857.1497418224. The cubic root of 140592000 is about 519.9802753859.
The spelling of 140592000 in words is "one hundred forty million, five hundred ninety-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •