Base | Representation |
---|---|
bin | 10000110001000… |
… | …01101011010001 |
3 | 100210122121120122 |
4 | 20120201223101 |
5 | 242001201441 |
6 | 21542320025 |
7 | 3325323626 |
oct | 1030415321 |
9 | 323577518 |
10 | 140647121 |
11 | 7243429a |
12 | 3b129015 |
13 | 231a5a64 |
14 | 1497234d |
15 | c53334b |
hex | 8621ad1 |
140647121 has 4 divisors (see below), whose sum is σ = 140808372. Its totient is φ = 140485872.
The previous prime is 140647099. The next prime is 140647159. The reversal of 140647121 is 121746041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51552400 + 89094721 = 7180^2 + 9439^2 .
It is a cyclic number.
It is not a de Polignac number, because 140647121 - 26 = 140647057 is a prime.
It is a super-2 number, since 2×1406471212 = 39563225291177282, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140647021) 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 3 ways as a sum of consecutive naturals, for example, 79310 + ... + 81063.
It is an arithmetic number, because the mean of its divisors is an integer number (35202093).
Almost surely, 2140647121 is an apocalyptic number.
It is an amenable number.
140647121 is a deficient number, since it is larger than the sum of its proper divisors (161251).
140647121 is an equidigital number, since it uses as much as digits as its factorization.
140647121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161250.
The product of its (nonzero) digits is 1344, while the sum is 26.
The square root of 140647121 is about 11859.4738922096. The cubic root of 140647121 is about 520.0482216129.
The spelling of 140647121 in words is "one hundred forty million, six hundred forty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •