Base | Representation |
---|---|
bin | 10000101101000… |
… | …01011110101111 |
3 | 100202122221021212 |
4 | 20112201132233 |
5 | 241332401111 |
6 | 21523145035 |
7 | 3321006020 |
oct | 1026413657 |
9 | 322587255 |
10 | 140122031 |
11 | 72105835 |
12 | 3ab1517b |
13 | 23050a5a |
14 | 14876c47 |
15 | c47c98b |
hex | 85a17af |
140122031 has 8 divisors (see below), whose sum is σ = 160221600. Its totient is φ = 120043008.
The previous prime is 140122019. The next prime is 140122033. The reversal of 140122031 is 130221041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140122031 - 226 = 73013167 is a prime.
It is a super-2 number, since 2×1401220312 = 39268367143129922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140121997 and 140122015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140122033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14495 + ... + 22143.
It is an arithmetic number, because the mean of its divisors is an integer number (20027700).
Almost surely, 2140122031 is an apocalyptic number.
140122031 is a deficient number, since it is larger than the sum of its proper divisors (20099569).
140122031 is an equidigital number, since it uses as much as digits as its factorization.
140122031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10273.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 140122031 is about 11837.3151939112. The cubic root of 140122031 is about 519.4002342878.
Adding to 140122031 its reverse (130221041), we get a palindrome (270343072).
It can be divided in two parts, 1401 and 22031, that added together give a palindrome (23432).
The spelling of 140122031 in words is "one hundred forty million, one hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •