Base | Representation |
---|---|
bin | 11010001000101111… |
… | …10110010110010001 |
3 | 1100012220200200111021 |
4 | 31010113312112101 |
5 | 212214143120442 |
6 | 10240214315441 |
7 | 1004504033050 |
oct | 150427662621 |
9 | 40186620437 |
10 | 14032004497 |
11 | 5a50778735 |
12 | 2877358b81 |
13 | 1428136354 |
14 | 971848397 |
15 | 571d55e67 |
hex | 3445f6591 |
14032004497 has 4 divisors (see below), whose sum is σ = 16036576576. Its totient is φ = 12027432420.
The previous prime is 14032004477. The next prime is 14032004531. The reversal of 14032004497 is 79440023041.
It is a happy number.
14032004497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14032004497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14032004417) 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 3 ways as a sum of consecutive naturals, for example, 1002286029 + ... + 1002286042.
It is an arithmetic number, because the mean of its divisors is an integer number (4009144144).
Almost surely, 214032004497 is an apocalyptic number.
It is an amenable number.
14032004497 is a deficient number, since it is larger than the sum of its proper divisors (2004572079).
14032004497 is an equidigital number, since it uses as much as digits as its factorization.
14032004497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2004572078.
The product of its (nonzero) digits is 24192, while the sum is 34.
The spelling of 14032004497 in words is "fourteen billion, thirty-two million, four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •