Base | Representation |
---|---|
bin | 101001011011000… |
… | …0111101111110000 |
3 | 10120212101012201111 |
4 | 1102312013233300 |
5 | 10321304403331 |
6 | 345530443104 |
7 | 46305055420 |
oct | 12266075760 |
9 | 3525335644 |
10 | 1389919216 |
11 | 653633974 |
12 | 329593494 |
13 | 191c5c20a |
14 | d284a480 |
15 | 82052db1 |
hex | 52d87bf0 |
1389919216 has 40 divisors (see below), whose sum is σ = 3079802880. Its totient is φ = 595268544.
The previous prime is 1389919211. The next prime is 1389919231. The reversal of 1389919216 is 6129199831.
It is a self number, because there is not a number n which added to its sum of digits gives 1389919216.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1389919211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203505 + ... + 210223.
It is an arithmetic number, because the mean of its divisors is an integer number (76995072).
Almost surely, 21389919216 is an apocalyptic number.
1389919216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1389919216 is an abundant number, since it is smaller than the sum of its proper divisors (1689883664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1389919216 is a wasteful number, since it uses less digits than its factorization.
1389919216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8581 (or 8575 counting only the distinct ones).
The product of its digits is 209952, while the sum is 49.
The square root of 1389919216 is about 37281.6203510523. The cubic root of 1389919216 is about 1115.9974092428.
The spelling of 1389919216 in words is "one billion, three hundred eighty-nine million, nine hundred nineteen thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •