Base | Representation |
---|---|
bin | 10000110011010… |
… | …11011000100101 |
3 | 100211012221201102 |
4 | 20121223120211 |
5 | 242040332104 |
6 | 21553005445 |
7 | 3331022054 |
oct | 1031533045 |
9 | 324187642 |
10 | 140949029 |
11 | 72620101 |
12 | 3b253885 |
13 | 232802c0 |
14 | 14a1039b |
15 | c592a1e |
hex | 866b625 |
140949029 has 4 divisors (see below), whose sum is σ = 151791276. Its totient is φ = 130106784.
The previous prime is 140949013. The next prime is 140949043. The reversal of 140949029 is 920949041.
It is a happy number.
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 80964004 + 59985025 = 8998^2 + 7745^2 .
It is a cyclic number.
It is not a de Polignac number, because 140949029 - 24 = 140949013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140948983 and 140949001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140949089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5421104 + ... + 5421129.
It is an arithmetic number, because the mean of its divisors is an integer number (37947819).
Almost surely, 2140949029 is an apocalyptic number.
It is an amenable number.
140949029 is a deficient number, since it is larger than the sum of its proper divisors (10842247).
140949029 is a wasteful number, since it uses less digits than its factorization.
140949029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10842246.
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 140949029 is about 11872.1956267575. The cubic root of 140949029 is about 520.4200612200.
The spelling of 140949029 in words is "one hundred forty million, nine hundred forty-nine thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •