Base | Representation |
---|---|
bin | 11010010000110011… |
… | …11100011011100100 |
3 | 1100101122000001220121 |
4 | 31020121330123210 |
5 | 212334003200224 |
6 | 10251032411324 |
7 | 1006255103641 |
oct | 151031743344 |
9 | 40348001817 |
10 | 14099662564 |
11 | 5a8598a199 |
12 | 2895b46b44 |
13 | 1439164c00 |
14 | 97a81adc8 |
15 | 577c6cbe4 |
hex | 34867c6e4 |
14099662564 has 27 divisors (see below), whose sum is σ = 26724295017. Its totient is φ = 6506111664.
The previous prime is 14099662543. The next prime is 14099662583. The reversal of 14099662564 is 46526699041.
The square root of 14099662564 is 118742.
It is a perfect power (a square), and thus also a powerful number.
14099662564 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., 2085748900 + 12013913664 = 45670^2 + 109608^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a Duffinian 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 8 ways as a sum of consecutive naturals, for example, 3085009 + ... + 3089575.
Almost surely, 214099662564 is an apocalyptic number.
14099662564 is the 118742-nd square number.
It is an amenable number.
14099662564 is a deficient number, since it is larger than the sum of its proper divisors (12624632453).
14099662564 is an frugal number, since it uses more digits than its factorization.
14099662564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9164 (or 4582 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 52.
The spelling of 14099662564 in words is "fourteen billion, ninety-nine million, six hundred sixty-two thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •