Base | Representation |
---|---|
bin | 1100001100011010101111… |
… | …0100110001111101100100 |
3 | 1202110202001000212022211201 |
4 | 3003012223310301331210 |
5 | 3224132002232432014 |
6 | 44303150450212244 |
7 | 2552441513556301 |
oct | 303065364617544 |
9 | 52422030768751 |
10 | 13407475670884 |
11 | 42aa095536299 |
12 | 1606560584084 |
13 | 763420016a49 |
14 | 344cd4da60a8 |
15 | 183b5c508e74 |
hex | c31abd31f64 |
13407475670884 has 27 divisors (see below), whose sum is σ = 24021989311257. Its totient is φ = 6547683167424.
The previous prime is 13407475670839. The next prime is 13407475670899. The reversal of 13407475670884 is 48807657470431.
The square root of 13407475670884 is 3661622.
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., 12224323468900 + 1183152201984 = 3496330^2 + 1087728^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 314878204 + ... + 314920780.
Almost surely, 213407475670884 is an apocalyptic number.
13407475670884 is the 3661622-nd square number.
It is an amenable number.
13407475670884 is a deficient number, since it is larger than the sum of its proper divisors (10614513640373).
13407475670884 is an frugal number, since it uses more digits than its factorization.
13407475670884 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85244 (or 42622 counting only the distinct ones).
The product of its (nonzero) digits is 126443520, while the sum is 64.
Multiplying 13407475670884 by its sum of digits (64), we get a square (858078442936576 = 292929762).
The spelling of 13407475670884 in words is "thirteen trillion, four hundred seven billion, four hundred seventy-five million, six hundred seventy thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •