Base | Representation |
---|---|
bin | 10000110000110… |
… | …00101010011000 |
3 | 100210120201221012 |
4 | 20120120222120 |
5 | 241444011300 |
6 | 21541433052 |
7 | 3325111163 |
oct | 1030305230 |
9 | 323521835 |
10 | 140610200 |
11 | 72409585 |
12 | 3b10b788 |
13 | 23192003 |
14 | 14962ada |
15 | c527435 |
hex | 8618a98 |
140610200 has 48 divisors (see below), whose sum is σ = 328338360. Its totient is φ = 56000000.
The previous prime is 140610199. The next prime is 140610227. The reversal of 140610200 is 2016041.
140610200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 48800 + ... + 51600.
Almost surely, 2140610200 is an apocalyptic number.
140610200 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 140610200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164169180).
140610200 is an abundant number, since it is smaller than the sum of its proper divisors (187728160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140610200 is a wasteful number, since it uses less digits than its factorization.
140610200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3068 (or 3059 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 140610200 is about 11857.9171864202. The cubic root of 140610200 is about 520.0027120174.
Adding to 140610200 its reverse (2016041), we get a palindrome (142626241).
The spelling of 140610200 in words is "one hundred forty million, six hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •