Base | Representation |
---|---|
bin | 10000101101010… |
… | …00100101010001 |
3 | 100202201102012021 |
4 | 20112220211101 |
5 | 241334313441 |
6 | 21523531441 |
7 | 3321156565 |
oct | 1026504521 |
9 | 322642167 |
10 | 140151121 |
11 | 72125680 |
12 | 3ab29b81 |
13 | 23061076 |
14 | 148836a5 |
15 | c4863d1 |
hex | 85a8951 |
140151121 has 16 divisors (see below), whose sum is σ = 160247808. Its totient is φ = 121330000.
The previous prime is 140151097. The next prime is 140151127. The reversal of 140151121 is 121151041.
It is not a de Polignac number, because 140151121 - 215 = 140118353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140151095 and 140151104.
It is not an unprimeable number, because it can be changed into a prime (140151127) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 62400 + ... + 64606.
It is an arithmetic number, because the mean of its divisors is an integer number (10015488).
Almost surely, 2140151121 is an apocalyptic number.
140151121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
140151121 is a deficient number, since it is larger than the sum of its proper divisors (20096687).
140151121 is a wasteful number, since it uses less digits than its factorization.
140151121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2492.
The product of its (nonzero) digits is 40, while the sum is 16.
The square root of 140151121 is about 11838.5438716085. The cubic root of 140151121 is about 519.4361751203.
It can be divided in two parts, 14015 and 1121, that multiplied together give a triangular number (15710815 = T5605).
The spelling of 140151121 in words is "one hundred forty million, one hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •