Base | Representation |
---|---|
bin | 11010001011101011… |
… | …00010100110010110 |
3 | 1100021121220111100210 |
4 | 31011311202212112 |
5 | 212241440041032 |
6 | 10242452550250 |
7 | 1005222555324 |
oct | 150565424626 |
9 | 40247814323 |
10 | 14056565142 |
11 | 5a63623494 |
12 | 2883622386 |
13 | 1430255589 |
14 | 974bdcd14 |
15 | 5740a82cc |
hex | 345d62996 |
14056565142 has 64 divisors (see below), whose sum is σ = 30513185280. Its totient is φ = 4301807616.
The previous prime is 14056565137. The next prime is 14056565143. The reversal of 14056565142 is 24156565041.
14056565142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 14056565142.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14056565143) 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 31 ways as a sum of consecutive naturals, for example, 1077543 + ... + 1090509.
It is an arithmetic number, because the mean of its divisors is an integer number (476768520).
Almost surely, 214056565142 is an apocalyptic number.
14056565142 is an abundant number, since it is smaller than the sum of its proper divisors (16456620138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14056565142 is a wasteful number, since it uses less digits than its factorization.
14056565142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13285.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 14056565142 in words is "fourteen billion, fifty-six million, five hundred sixty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •