Base | Representation |
---|---|
bin | 11000011110101110… |
… | …10001111000001001 |
3 | 1020220221020102211220 |
4 | 30033113101320021 |
5 | 203404010201130 |
6 | 10012044512253 |
7 | 643454534526 |
oct | 141727217011 |
9 | 36827212756 |
10 | 13142662665 |
11 | 5634765a90 |
12 | 266954b689 |
13 | 1315b01c92 |
14 | 8c96a414d |
15 | 51dc32410 |
hex | 30f5d1e09 |
13142662665 has 32 divisors (see below), whose sum is σ = 22957848576. Its totient is φ = 6367220160.
The previous prime is 13142662657. The next prime is 13142662679. The reversal of 13142662665 is 56626624131.
13142662665 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13142662665 - 23 = 13142662657 is a prime.
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 31 ways as a sum of consecutive naturals, for example, 185184 + ... + 246126.
It is an arithmetic number, because the mean of its divisors is an integer number (717432768).
Almost surely, 213142662665 is an apocalyptic number.
13142662665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13142662665 is a deficient number, since it is larger than the sum of its proper divisors (9815185911).
13142662665 is a wasteful number, since it uses less digits than its factorization.
13142662665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62269.
The product of its digits is 311040, while the sum is 42.
The spelling of 13142662665 in words is "thirteen billion, one hundred forty-two million, six hundred sixty-two thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •