Base | Representation |
---|---|
bin | 101001010101011… |
… | …0110111000100100 |
3 | 10120122211012110000 |
4 | 1102222312320210 |
5 | 10320030412224 |
6 | 345343301300 |
7 | 46241010204 |
oct | 12252667044 |
9 | 3518735400 |
10 | 1386966564 |
11 | 6519a7565 |
12 | 3285aa830 |
13 | 191467299 |
14 | d22bc404 |
15 | 81b6d0c9 |
hex | 52ab6e24 |
1386966564 has 45 divisors (see below), whose sum is σ = 3627557857. Its totient is φ = 462098736.
The previous prime is 1386966551. The next prime is 1386966583. The reversal of 1386966564 is 4656696831.
The square root of 1386966564 is 37242.
It is a perfect power (a square), and thus also a powerful number.
1386966564 is a `hidden beast` number, since 13 + 8 + 6 + 9 + 66 + 564 = 666.
It can be written as a sum of positive squares in only one way, i.e., 217326564 + 1169640000 = 14742^2 + 34200^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1386966564.
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 669322 + ... + 671390.
Almost surely, 21386966564 is an apocalyptic number.
1386966564 is the 37242-nd square number.
It is an amenable number.
1386966564 is an abundant number, since it is smaller than the sum of its proper divisors (2240591293).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1386966564 is an frugal number, since it uses more digits than its factorization.
1386966564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4154 (or 2074 counting only the distinct ones).
The product of its digits is 5598720, while the sum is 54.
The cubic root of 1386966564 is about 1115.2065987563.
The spelling of 1386966564 in words is "one billion, three hundred eighty-six million, nine hundred sixty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •