Base | Representation |
---|---|
bin | 110010000001001010… |
… | …101100011110001001 |
3 | 12010121220120121201100 |
4 | 302001022230132021 |
5 | 1334442402001014 |
6 | 40401132212013 |
7 | 3610621115454 |
oct | 620112543611 |
9 | 163556517640 |
10 | 53706672009 |
11 | 2086001a651 |
12 | a4aa30a009 |
13 | 50ab98b483 |
14 | 2856b2a49b |
15 | 15e4ec8009 |
hex | c812ac789 |
53706672009 has 9 divisors (see below), whose sum is σ = 77577308263. Its totient is φ = 35803984512.
The previous prime is 53706671969. The next prime is 53706672011. The reversal of 53706672009 is 90027660735.
The square root of 53706672009 is 231747.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 68112009 + 53638560000 = 8253^2 + 231600^2 .
It is a tau number, because it is divible by the number of its divisors (9).
It is a de Polignac number, because none of the positive numbers 2k-53706672009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53706672029) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 656617 + ... + 733865.
Almost surely, 253706672009 is an apocalyptic number.
53706672009 is the 231747-th square number.
53706672009 is the 115874-th centered octagonal number.
It is an amenable number.
53706672009 is a deficient number, since it is larger than the sum of its proper divisors (23870636254).
53706672009 is an frugal number, since it uses more digits than its factorization.
53706672009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154504 (or 77252 counting only the distinct ones).
The product of its (nonzero) digits is 476280, while the sum is 45.
The spelling of 53706672009 in words is "fifty-three billion, seven hundred six million, six hundred seventy-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •