Base | Representation |
---|---|
bin | 11010101111110010… |
… | …00001101000010001 |
3 | 1101001201212120201221 |
4 | 31113321001220101 |
5 | 213402010443221 |
6 | 10332513125041 |
7 | 1015561316554 |
oct | 152771015021 |
9 | 41051776657 |
10 | 14359468561 |
11 | 60a9600299 |
12 | 2948b59781 |
13 | 147ac2ba79 |
14 | 9a312a69b |
15 | 59098c541 |
hex | 357e41a11 |
14359468561 has 3 divisors (see below), whose sum is σ = 14359588393. Its totient is φ = 14359348730.
The previous prime is 14359468549. The next prime is 14359468567. The reversal of 14359468561 is 16586495341.
It is a happy number.
The square root of 14359468561 is 119831.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 14359468561 - 215 = 14359435793 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14359468499 and 14359468508.
It is not an unprimeable number, because it can be changed into a prime (14359468567) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 59916 + ... + 179746.
Almost surely, 214359468561 is an apocalyptic number.
14359468561 is the 119831-st square number.
14359468561 is the 59916-th centered octagonal number.
It is an amenable number.
14359468561 is a deficient number, since it is larger than the sum of its proper divisors (119832).
14359468561 is an frugal number, since it uses more digits than its factorization.
14359468561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239662 (or 119831 counting only the distinct ones).
The product of its digits is 3110400, while the sum is 52.
The spelling of 14359468561 in words is "fourteen billion, three hundred fifty-nine million, four hundred sixty-eight thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •