Base | Representation |
---|---|
bin | 10000111011001… |
… | …00110100101001 |
3 | 100220010212020011 |
4 | 20131210310221 |
5 | 242321030404 |
6 | 22030531521 |
7 | 3342505555 |
oct | 1035446451 |
9 | 326125204 |
10 | 141970729 |
11 | 7315878a |
12 | 3b666ba1 |
13 | 2354a364 |
14 | 14bd8865 |
15 | c6e5604 |
hex | 8764d29 |
141970729 has 8 divisors (see below), whose sum is σ = 147024072. Its totient is φ = 137005440.
The previous prime is 141970721. The next prime is 141970769. The reversal of 141970729 is 927079141.
It can be written as a sum of positive squares in 4 ways, for example, as 16418704 + 125552025 = 4052^2 + 11205^2 .
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 141970729 - 23 = 141970721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141970691 and 141970700.
It is not an unprimeable number, because it can be changed into a prime (141970721) 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 7 ways as a sum of consecutive naturals, for example, 18724 + ... + 25189.
It is an arithmetic number, because the mean of its divisors is an integer number (18378009).
Almost surely, 2141970729 is an apocalyptic number.
It is an amenable number.
141970729 is a deficient number, since it is larger than the sum of its proper divisors (5053343).
141970729 is an equidigital number, since it uses as much as digits as its factorization.
141970729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44027.
The product of its (nonzero) digits is 31752, while the sum is 40.
The square root of 141970729 is about 11915.1470406370. The cubic root of 141970729 is about 521.6744947851.
The spelling of 141970729 in words is "one hundred forty-one million, nine hundred seventy thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •