Base | Representation |
---|---|
bin | 111100101011000011… |
… | …111000011000110001 |
3 | 20020011012110210212101 |
4 | 330223003320120301 |
5 | 2031410104301441 |
6 | 45532245100401 |
7 | 4464254625304 |
oct | 745303703061 |
9 | 206135423771 |
10 | 65146947121 |
11 | 256a0831673 |
12 | 107616b7701 |
13 | 61b2b89229 |
14 | 3220286b3b |
15 | 1a64534231 |
hex | f2b0f8631 |
65146947121 has 3 divisors (see below), whose sum is σ = 65147202361. Its totient is φ = 65146691882.
The previous prime is 65146947097. The next prime is 65146947127. The reversal of 65146947121 is 12174964156.
The square root of 65146947121 is 255239.
It is a perfect power (a square), and thus also a powerful number.
65146947121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 65146947121 - 215 = 65146914353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65146947127) 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, 127620 + ... + 382858.
Almost surely, 265146947121 is an apocalyptic number.
65146947121 is the 255239-th square number.
65146947121 is the 127620-th centered octagonal number.
It is an amenable number.
65146947121 is a deficient number, since it is larger than the sum of its proper divisors (255240).
65146947121 is an frugal number, since it uses more digits than its factorization.
65146947121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510478 (or 255239 counting only the distinct ones).
The product of its digits is 362880, while the sum is 46.
The spelling of 65146947121 in words is "sixty-five billion, one hundred forty-six million, nine hundred forty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •