Base | Representation |
---|---|
bin | 10000110001110… |
… | …11000110000010 |
3 | 100210211220101200 |
4 | 20120323012002 |
5 | 242013014414 |
6 | 21544442030 |
7 | 3326236311 |
oct | 1030730602 |
9 | 323756350 |
10 | 140751234 |
11 | 724a5538 |
12 | 3b179316 |
13 | 23211270 |
14 | 1499c278 |
15 | c554109 |
hex | 863b182 |
140751234 has 48 divisors (see below), whose sum is σ = 332422272. Its totient is φ = 42780384.
The previous prime is 140751139. The next prime is 140751241. The reversal of 140751234 is 432157041.
140751234 is a `hidden beast` number, since 140 + 7 + 512 + 3 + 4 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 140751198 and 140751207.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 15799 + ... + 23045.
It is an arithmetic number, because the mean of its divisors is an integer number (6925464).
Almost surely, 2140751234 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140751234, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166211136).
140751234 is an abundant number, since it is smaller than the sum of its proper divisors (191671038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140751234 is a wasteful number, since it uses less digits than its factorization.
140751234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7351 (or 7348 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 140751234 is about 11863.8625244901. The cubic root of 140751234 is about 520.1765105907.
The spelling of 140751234 in words is "one hundred forty million, seven hundred fifty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •