Base | Representation |
---|---|
bin | 11010010111110100… |
… | …10101011010010101 |
3 | 1100112201200120022120 |
4 | 31023322111122111 |
5 | 212444033011031 |
6 | 10300533250153 |
7 | 1010601065223 |
oct | 151372253225 |
9 | 40481616276 |
10 | 14158485141 |
11 | 6006106499 |
12 | 28b1793959 |
13 | 14483bbc78 |
14 | 98456db13 |
15 | 57cedba96 |
hex | 34be95695 |
14158485141 has 8 divisors (see below), whose sum is σ = 18956313024. Its totient is φ = 9399823680.
The previous prime is 14158485073. The next prime is 14158485161.
It is a happy number.
14158485141 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14158485141 - 211 = 14158483093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14158485093 and 14158485102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14158485161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9790761 + ... + 9792206.
It is an arithmetic number, because the mean of its divisors is an integer number (2369539128).
Almost surely, 214158485141 is an apocalyptic number.
It is an amenable number.
14158485141 is a deficient number, since it is larger than the sum of its proper divisors (4797827883).
14158485141 is a wasteful number, since it uses less digits than its factorization.
14158485141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19583211.
The product of its digits is 102400, while the sum is 42.
The spelling of 14158485141 in words is "fourteen billion, one hundred fifty-eight million, four hundred eighty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •