Base | Representation |
---|---|
bin | 11011010111011011… |
… | …11100000100011001 |
3 | 1101220220210100020101 |
4 | 31223231330010121 |
5 | 220042134402041 |
6 | 10425514455401 |
7 | 1030040562541 |
oct | 155355740431 |
9 | 41826710211 |
10 | 14692106521 |
11 | 625a3470a4 |
12 | 2a20434561 |
13 | 1501b16471 |
14 | 9d5398321 |
15 | 5aec96b31 |
hex | 36bb7c119 |
14692106521 has 9 divisors (see below), whose sum is σ = 14981096991. Its totient is φ = 14408593992.
The previous prime is 14692106477. The next prime is 14692106531. The reversal of 14692106521 is 12560129641.
The square root of 14692106521 is 121211.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10591497225 + 4100609296 = 102915^2 + 64036^2 .
It is a de Polignac number, because none of the positive numbers 2k-14692106521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14692106531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6423040 + ... + 6425326.
Almost surely, 214692106521 is an apocalyptic number.
14692106521 is the 121211-st square number.
14692106521 is the 60606-th centered octagonal number.
It is an amenable number.
14692106521 is a deficient number, since it is larger than the sum of its proper divisors (288990470).
14692106521 is an frugal number, since it uses more digits than its factorization.
14692106521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4680 (or 2340 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 14692106521 in words is "fourteen billion, six hundred ninety-two million, one hundred six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •