Base | Representation |
---|---|
bin | 11011110101101011… |
… | …01011111110101001 |
3 | 1102120121011002210100 |
4 | 31322311223332221 |
5 | 221102110433014 |
6 | 10511020140013 |
7 | 1036241112204 |
oct | 157265537651 |
9 | 42517132710 |
10 | 14945796009 |
11 | 637a56a831 |
12 | 2a91397609 |
13 | 154254b2a1 |
14 | a1ad5493b |
15 | 5c71a9009 |
hex | 37ad6bfa9 |
14945796009 has 9 divisors (see below), whose sum is σ = 21588901789. Its totient is φ = 9963619500.
The previous prime is 14945796001. The next prime is 14945796053. The reversal of 14945796009 is 90069754941.
It is a happy number.
The square root of 14945796009 is 122253.
It is a perfect power (a square), and thus also a powerful number.
14945796009 is a `hidden beast` number, since 1 + 4 + 9 + 4 + 579 + 60 + 0 + 9 = 666.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 14945796009 - 23 = 14945796001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14945796001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 346384 + ... + 387134.
Almost surely, 214945796009 is an apocalyptic number.
14945796009 is the 122253-rd square number.
14945796009 is the 61127-th centered octagonal number.
It is an amenable number.
14945796009 is a deficient number, since it is larger than the sum of its proper divisors (6643105780).
14945796009 is an frugal number, since it uses more digits than its factorization.
14945796009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81508 (or 40754 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 54.
The spelling of 14945796009 in words is "fourteen billion, nine hundred forty-five million, seven hundred ninety-six thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •