Base | Representation |
---|---|
bin | 11010010001011000… |
… | …00011111110001101 |
3 | 1100101221221100222022 |
4 | 31020230003332031 |
5 | 212341212141140 |
6 | 10251322255525 |
7 | 1006343344553 |
oct | 151054037615 |
9 | 40357840868 |
10 | 14104412045 |
11 | 5a88633589 |
12 | 28976575a5 |
13 | 143a138959 |
14 | 97b2d5bd3 |
15 | 5783aa0b5 |
hex | 348b03f8d |
14104412045 has 8 divisors (see below), whose sum is σ = 17083475424. Its totient is φ = 11178075664.
The previous prime is 14104412041. The next prime is 14104412053. The reversal of 14104412045 is 54021440141.
14104412045 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 14104412045 - 22 = 14104412041 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14104412041) 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, 13181159 + ... + 13182228.
It is an arithmetic number, because the mean of its divisors is an integer number (2135434428).
Almost surely, 214104412045 is an apocalyptic number.
It is an amenable number.
14104412045 is a deficient number, since it is larger than the sum of its proper divisors (2979063379).
14104412045 is a wasteful number, since it uses less digits than its factorization.
14104412045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26363499.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 14104412045 its reverse (54021440141), we get a palindrome (68125852186).
The spelling of 14104412045 in words is "fourteen billion, one hundred four million, four hundred twelve thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •