Base | Representation |
---|---|
bin | 101001011101000… |
… | …1101001010001000 |
3 | 10120221101121111200 |
4 | 1102322031022020 |
5 | 10322043134320 |
6 | 350005424200 |
7 | 46320135213 |
oct | 12272151210 |
9 | 3527347450 |
10 | 1390989960 |
11 | 6541a5388 |
12 | 329a0b060 |
13 | 1922456a9 |
14 | d2a4877a |
15 | 821b5290 |
hex | 52e8d288 |
1390989960 has 48 divisors (see below), whose sum is σ = 4520718540. Its totient is φ = 370930560.
The previous prime is 1390989949. The next prime is 1390989967. The reversal of 1390989960 is 699890931.
It can be written as a sum of positive squares in 2 ways, for example, as 1287804996 + 103184964 = 35886^2 + 10158^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1390989897 and 1390989906.
It is not an unprimeable number, because it can be changed into a prime (1390989967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1931571 + ... + 1932290.
Almost surely, 21390989960 is an apocalyptic number.
1390989960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1390989960 is an abundant number, since it is smaller than the sum of its proper divisors (3129728580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1390989960 is a wasteful number, since it uses less digits than its factorization.
1390989960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3863878 (or 3863871 counting only the distinct ones).
The product of its (nonzero) digits is 944784, while the sum is 54.
The square root of 1390989960 is about 37295.9777992212. The cubic root of 1390989960 is about 1116.2839105011.
The spelling of 1390989960 in words is "one billion, three hundred ninety million, nine hundred eighty-nine thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •