Base | Representation |
---|---|
bin | 11010001011001011… |
… | …10001100011110001 |
3 | 1100021100010111220122 |
4 | 31011211301203301 |
5 | 212234410311423 |
6 | 10242224220025 |
7 | 1005142462556 |
oct | 150545614361 |
9 | 40240114818 |
10 | 14052432113 |
11 | 5a61260265 |
12 | 288216a615 |
13 | 142c4392b5 |
14 | 974444a2d |
15 | 573a3d8c8 |
hex | 3459718f1 |
14052432113 has 8 divisors (see below), whose sum is σ = 14296214016. Its totient is φ = 13810423600.
The previous prime is 14052432047. The next prime is 14052432133. The reversal of 14052432113 is 31123425041.
It is a happy number.
14052432113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 14052432113 - 28 = 14052431857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14052432133) 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, 427358 + ... + 459063.
It is an arithmetic number, because the mean of its divisors is an integer number (1787026752).
Almost surely, 214052432113 is an apocalyptic number.
It is an amenable number.
14052432113 is a deficient number, since it is larger than the sum of its proper divisors (243781903).
14052432113 is an equidigital number, since it uses as much as digits as its factorization.
14052432113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886695.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 14052432113 its reverse (31123425041), we get a palindrome (45175857154).
The spelling of 14052432113 in words is "fourteen billion, fifty-two million, four hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •