Base | Representation |
---|---|
bin | 11011000100001111… |
… | …10001011110110101 |
3 | 1101111200211201001120 |
4 | 31202013301132311 |
5 | 214224430403431 |
6 | 10401524014153 |
7 | 1023044240454 |
oct | 154207613665 |
9 | 41450751046 |
10 | 14531106741 |
11 | 6187481628 |
12 | 2996531359 |
13 | 14a7665918 |
14 | 9bbc48b9b |
15 | 5a0a93196 |
hex | 3621f17b5 |
14531106741 has 8 divisors (see below), whose sum is σ = 19430325600. Its totient is φ = 9659646192.
The previous prime is 14531106739. The next prime is 14531106757. The reversal of 14531106741 is 14760113541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14531106741 - 21 = 14531106739 is a prime.
It is a super-2 number, since 2×145311067412 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14531106721) 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, 6938355 + ... + 6940448.
It is an arithmetic number, because the mean of its divisors is an integer number (2428790700).
Almost surely, 214531106741 is an apocalyptic number.
It is an amenable number.
14531106741 is a deficient number, since it is larger than the sum of its proper divisors (4899218859).
14531106741 is a wasteful number, since it uses less digits than its factorization.
14531106741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13879155.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 14531106741 in words is "fourteen billion, five hundred thirty-one million, one hundred six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •