Base | Representation |
---|---|
bin | 100000010110001100… |
… | …1101010001101010001 |
3 | 20122022002112011210021 |
4 | 1000230121222031101 |
5 | 2114230341310341 |
6 | 51524515103441 |
7 | 5006251443502 |
oct | 1005431521521 |
9 | 218262464707 |
10 | 69464400721 |
11 | 27506930441 |
12 | 115675a1b81 |
13 | 67204a9ac1 |
14 | 350d834ba9 |
15 | 1c185b49d1 |
hex | 102c66a351 |
69464400721 has 3 divisors (see below), whose sum is σ = 69464664283. Its totient is φ = 69464137160.
The previous prime is 69464400703. The next prime is 69464400743. The reversal of 69464400721 is 12700446496.
The square root of 69464400721 is 263561.
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 can be written as a sum of positive squares in only one way, i.e., 17553335121 + 51911065600 = 132489^2 + 227840^2 .
It is a de Polignac number, because none of the positive numbers 2k-69464400721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (69464404721) 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, 131781 + ... + 395341.
Almost surely, 269464400721 is an apocalyptic number.
69464400721 is the 263561-st square number.
69464400721 is the 131781-st centered octagonal number.
It is an amenable number.
69464400721 is a deficient number, since it is larger than the sum of its proper divisors (263562).
69464400721 is an frugal number, since it uses more digits than its factorization.
69464400721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527122 (or 263561 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 43.
The spelling of 69464400721 in words is "sixty-nine billion, four hundred sixty-four million, four hundred thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •