Base | Representation |
---|---|
bin | 10000110111100… |
… | …00111111111111 |
3 | 100212020202110102 |
4 | 20123300333333 |
5 | 242210340234 |
6 | 22012431315 |
7 | 3335461466 |
oct | 1033607777 |
9 | 325222412 |
10 | 141496319 |
11 | 72964308 |
12 | 3b47853b |
13 | 23412443 |
14 | 14b139dd |
15 | c64ec7e |
hex | 86f0fff |
141496319 has 4 divisors (see below), whose sum is σ = 141755544. Its totient is φ = 141237096.
The previous prime is 141496297. The next prime is 141496331. The reversal of 141496319 is 913694141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 913694141 = 2347 ⋅389303.
It is a cyclic number.
It is not a de Polignac number, because 141496319 - 212 = 141492223 is a prime.
It is a super-2 number, since 2×1414963192 = 40042416581099522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141496339) 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 3 ways as a sum of consecutive naturals, for example, 128792 + ... + 129885.
It is an arithmetic number, because the mean of its divisors is an integer number (35438886).
Almost surely, 2141496319 is an apocalyptic number.
141496319 is a deficient number, since it is larger than the sum of its proper divisors (259225).
141496319 is an equidigital number, since it uses as much as digits as its factorization.
141496319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259224.
The product of its digits is 23328, while the sum is 38.
The square root of 141496319 is about 11895.2225283935. Note that the first 3 decimals coincide. The cubic root of 141496319 is about 521.0927697580.
The spelling of 141496319 in words is "one hundred forty-one million, four hundred ninety-six thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •