Base | Representation |
---|---|
bin | 10000110010010… |
… | …01010011001110 |
3 | 100210221212012210 |
4 | 20121021103032 |
5 | 242021400142 |
6 | 21550011250 |
7 | 3326601045 |
oct | 1031112316 |
9 | 323855183 |
10 | 140809422 |
11 | 72535226 |
12 | 3b1a6b26 |
13 | 232318b0 |
14 | 149b555c |
15 | c56649c |
hex | 86494ce |
140809422 has 32 divisors (see below), whose sum is σ = 305518752. Its totient is φ = 43006464.
The previous prime is 140809421. The next prime is 140809423. The reversal of 140809422 is 224908041.
It is an interprime number because it is at equal distance from previous prime (140809421) and next prime (140809423).
It is a self number, because there is not a number n which added to its sum of digits gives 140809422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140809421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4098 + ... + 17274.
It is an arithmetic number, because the mean of its divisors is an integer number (9547461).
Almost surely, 2140809422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140809422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152759376).
140809422 is an abundant number, since it is smaller than the sum of its proper divisors (164709330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140809422 is a wasteful number, since it uses less digits than its factorization.
140809422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13332.
The product of its (nonzero) digits is 4608, while the sum is 30.
The square root of 140809422 is about 11866.3145921554. The cubic root of 140809422 is about 520.2481828118.
The spelling of 140809422 in words is "one hundred forty million, eight hundred nine thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •