Base | Representation |
---|---|
bin | 11010001011101010… |
… | …10101010001100101 |
3 | 1100021121210201111102 |
4 | 31011311111101211 |
5 | 212241431314230 |
6 | 10242451445445 |
7 | 1005222240236 |
oct | 150565252145 |
9 | 40247721442 |
10 | 14056510565 |
11 | 5a63596489 |
12 | 28835b6885 |
13 | 1430236796 |
14 | 974bc708d |
15 | 574097045 |
hex | 345d55465 |
14056510565 has 16 divisors (see below), whose sum is σ = 16915046400. Its totient is φ = 11213764992.
The previous prime is 14056510549. The next prime is 14056510597. The reversal of 14056510565 is 56501565041.
It is a happy number.
14056510565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14056510565 - 24 = 14056510549 is a prime.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3636824 + ... + 3640686.
It is an arithmetic number, because the mean of its divisors is an integer number (1057190400).
Almost surely, 214056510565 is an apocalyptic number.
It is an amenable number.
14056510565 is a deficient number, since it is larger than the sum of its proper divisors (2858535835).
14056510565 is a wasteful number, since it uses less digits than its factorization.
14056510565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5716.
The product of its (nonzero) digits is 90000, while the sum is 38.
The spelling of 14056510565 in words is "fourteen billion, fifty-six million, five hundred ten thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.929 sec. • engine limits •