Base | Representation |
---|---|
bin | 1100111111000000010100… |
… | …0010111000111100000001 |
3 | 1212112211021201201002221001 |
4 | 3033300011002320330001 |
5 | 3332401341304413424 |
6 | 50210320444332001 |
7 | 3002306236124551 |
oct | 317600502707401 |
9 | 55484251632831 |
10 | 14276555935489 |
11 | 4604720700261 |
12 | 1726a85844001 |
13 | 7c73729c4523 |
14 | 374dbbb2b161 |
15 | 19b5752d2844 |
hex | cfc050b8f01 |
14276555935489 has 9 divisors (see below), whose sum is σ = 14386867996449. Its totient is φ = 14167083396180.
The previous prime is 14276555935483. The next prime is 14276555935513. The reversal of 14276555935489 is 98453955567241.
The square root of 14276555935489 is 3778433.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 14276555935489 - 213 = 14276555927297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14276555935483) 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, 494960302 + ... + 494989144.
Almost surely, 214276555935489 is an apocalyptic number.
14276555935489 is the 3778433-rd square number.
14276555935489 is the 1889217-th centered octagonal number.
It is an amenable number.
14276555935489 is a deficient number, since it is larger than the sum of its proper divisors (110312060960).
14276555935489 is an frugal number, since it uses more digits than its factorization.
14276555935489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57948 (or 28974 counting only the distinct ones).
The product of its digits is 1632960000, while the sum is 73.
The spelling of 14276555935489 in words is "fourteen trillion, two hundred seventy-six billion, five hundred fifty-five million, nine hundred thirty-five thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •