Base | Representation |
---|---|
bin | 10100001101101000011… |
… | …011101011111111011110 |
3 | 11220210022122110111220102 |
4 | 110031220123223333132 |
5 | 140224211242301100 |
6 | 2542035431021102 |
7 | 202232241441005 |
oct | 24155033537736 |
9 | 4823278414812 |
10 | 1389026525150 |
11 | 4960a0297210 |
12 | 1a525220a792 |
13 | a0ca53389a4 |
14 | 4b32d081c3c |
15 | 261e9aaecd5 |
hex | 143686ebfde |
1389026525150 has 24 divisors (see below), whose sum is σ = 2818461095784. Its totient is φ = 505100554400.
The previous prime is 1389026525147. The next prime is 1389026525177. The reversal of 1389026525150 is 515256209831.
It is a hoax number, since the sum of its digits (47) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1389026525095 and 1389026525104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1262750837 + ... + 1262751936.
It is an arithmetic number, because the mean of its divisors is an integer number (117435878991).
Almost surely, 21389026525150 is an apocalyptic number.
1389026525150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1389026525150 is an abundant number, since it is smaller than the sum of its proper divisors (1429434570634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1389026525150 is a wasteful number, since it uses less digits than its factorization.
1389026525150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2525502796 (or 2525502791 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 47.
The spelling of 1389026525150 in words is "one trillion, three hundred eighty-nine billion, twenty-six million, five hundred twenty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •