Base | Representation |
---|---|
bin | 11010100001011011… |
… | …00101110010100101 |
3 | 1100202100020200200200 |
4 | 31100231211302211 |
5 | 213130142433222 |
6 | 10312531501113 |
7 | 1012566522162 |
oct | 152055456245 |
9 | 40670220620 |
10 | 14239030437 |
11 | 604761a355 |
12 | 2914757799 |
13 | 145bcb05c8 |
14 | 991139069 |
15 | 5850ebeac |
hex | 350b65ca5 |
14239030437 has 6 divisors (see below), whose sum is σ = 20567488422. Its totient is φ = 9492686952.
The previous prime is 14239030433. The next prime is 14239030439. The reversal of 14239030437 is 73403093241.
14239030437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 7831188036 + 6407842401 = 88494^2 + 80049^2 .
It is not a de Polignac number, because 14239030437 - 22 = 14239030433 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14239030433) 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 5 ways as a sum of consecutive naturals, for example, 791057238 + ... + 791057255.
It is an arithmetic number, because the mean of its divisors is an integer number (3427914737).
Almost surely, 214239030437 is an apocalyptic number.
It is an amenable number.
14239030437 is a deficient number, since it is larger than the sum of its proper divisors (6328457985).
14239030437 is a wasteful number, since it uses less digits than its factorization.
14239030437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582114499 (or 1582114496 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 36.
The spelling of 14239030437 in words is "fourteen billion, two hundred thirty-nine million, thirty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •