Base | Representation |
---|---|
bin | 10000111011001… |
… | …10110110011111 |
3 | 100220011021121221 |
4 | 20131212312133 |
5 | 242321312124 |
6 | 22031034211 |
7 | 3342542026 |
oct | 1035466637 |
9 | 326137557 |
10 | 141979039 |
11 | 73163a54 |
12 | 3b66b967 |
13 | 23551087 |
14 | 14bdb8bd |
15 | c6e7ce4 |
hex | 8766d9f |
141979039 has 8 divisors (see below), whose sum is σ = 154273280. Its totient is φ = 130167000.
The previous prime is 141978989. The next prime is 141979043. The reversal of 141979039 is 930979141.
It is a happy number.
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 141979039 - 217 = 141847967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141978986 and 141979004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141979139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119937 + ... + 121114.
It is an arithmetic number, because the mean of its divisors is an integer number (19284160).
Almost surely, 2141979039 is an apocalyptic number.
141979039 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
141979039 is a deficient number, since it is larger than the sum of its proper divisors (12294241).
141979039 is a wasteful number, since it uses less digits than its factorization.
141979039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241101.
The product of its (nonzero) digits is 61236, while the sum is 43.
The square root of 141979039 is about 11915.4957513315. The cubic root of 141979039 is about 521.6846730111.
The spelling of 141979039 in words is "one hundred forty-one million, nine hundred seventy-nine thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •