Base | Representation |
---|---|
bin | 1101001101110001010000… |
… | …0010010100001010011001 |
3 | 1220110002000100112202200201 |
4 | 3103130110002110022121 |
5 | 3401030332342413221 |
6 | 50523030410302201 |
7 | 3026526106352101 |
oct | 323342402241231 |
9 | 56402010482621 |
10 | 14530210513561 |
11 | 46a2256040066 |
12 | 1768076127961 |
13 | 815267c62642 |
14 | 3833a1a58201 |
15 | 1a2e6dd8e891 |
hex | d3714094299 |
14530210513561 has 2 divisors, whose sum is σ = 14530210513562. Its totient is φ = 14530210513560.
The previous prime is 14530210513547. The next prime is 14530210513627. The reversal of 14530210513561 is 16531501203541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14259165329161 + 271045184400 = 3776131^2 + 520620^2 .
It is a cyclic number.
It is not a de Polignac number, because 14530210513561 - 27 = 14530210513433 is a prime.
It is a super-2 number, since 2×145302105135612 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14530210513561.
It is not a weakly prime, because it can be changed into another prime (14530219513561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7265105256780 + 7265105256781.
It is an arithmetic number, because the mean of its divisors is an integer number (7265105256781).
Almost surely, 214530210513561 is an apocalyptic number.
It is an amenable number.
14530210513561 is a deficient number, since it is larger than the sum of its proper divisors (1).
14530210513561 is an equidigital number, since it uses as much as digits as its factorization.
14530210513561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 14530210513561 in words is "fourteen trillion, five hundred thirty billion, two hundred ten million, five hundred thirteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •