Base | Representation |
---|---|
bin | 10000110110110… |
… | …11000100000111 |
3 | 100212002012012201 |
4 | 20123123010013 |
5 | 242200001341 |
6 | 22010455331 |
7 | 3334635523 |
oct | 1033330407 |
9 | 325065181 |
10 | 141406471 |
11 | 72902858 |
12 | 3b434547 |
13 | 233b058b |
14 | 14accd83 |
15 | c633331 |
hex | 86db107 |
141406471 has 4 divisors (see below), whose sum is σ = 141433600. Its totient is φ = 141379344.
The previous prime is 141406457. The next prime is 141406477. The reversal of 141406471 is 174604141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 174604141 = 79 ⋅2210179.
It is a cyclic number.
It is not a de Polignac number, because 141406471 - 217 = 141275399 is a prime.
It is a super-3 number, since 3×1414064713 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141406477) 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, 3006 + ... + 17083.
It is an arithmetic number, because the mean of its divisors is an integer number (35358400).
Almost surely, 2141406471 is an apocalyptic number.
141406471 is a deficient number, since it is larger than the sum of its proper divisors (27129).
141406471 is an equidigital number, since it uses as much as digits as its factorization.
141406471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27128.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 141406471 is about 11891.4452864233. The cubic root of 141406471 is about 520.9824510896.
The spelling of 141406471 in words is "one hundred forty-one million, four hundred six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •