Base | Representation |
---|---|
bin | 101001001000101… |
… | …1000101110110000 |
3 | 10120012020222011201 |
4 | 1102101120232300 |
5 | 10311323230311 |
6 | 344544220544 |
7 | 46130160340 |
oct | 12221305660 |
9 | 3505228151 |
10 | 1380289456 |
11 | 649156997 |
12 | 32630a754 |
13 | 18cc6a030 |
14 | d1460d20 |
15 | 8129e9c1 |
hex | 52458bb0 |
1380289456 has 80 divisors (see below), whose sum is σ = 3345633088. Its totient is φ = 537062400.
The previous prime is 1380289451. The next prime is 1380289459. The reversal of 1380289456 is 6549820831.
It is not an unprimeable number, because it can be changed into a prime (1380289451) 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 15 ways as a sum of consecutive naturals, for example, 81046 + ... + 96586.
Almost surely, 21380289456 is an apocalyptic number.
1380289456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1380289456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1672816544).
1380289456 is an abundant number, since it is smaller than the sum of its proper divisors (1965343632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1380289456 is a wasteful number, since it uses less digits than its factorization.
1380289456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15630 (or 15624 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 46.
The square root of 1380289456 is about 37152.2469845365. The cubic root of 1380289456 is about 1113.4141171098.
The spelling of 1380289456 in words is "one billion, three hundred eighty million, two hundred eighty-nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •