Base | Representation |
---|---|
bin | 10100001011000111011… |
… | …110011111100010111001 |
3 | 11220112100110012011112201 |
4 | 110023013132133202321 |
5 | 140203143442110300 |
6 | 2540511444110201 |
7 | 202105311444301 |
oct | 24130736374271 |
9 | 4815313164481 |
10 | 1386326128825 |
11 | 494a34a5a510 |
12 | 1a4819995361 |
13 | a0964a43a41 |
14 | 4b154588601 |
15 | 260dc99c66a |
hex | 142c779f8b9 |
1386326128825 has 48 divisors (see below), whose sum is σ = 1890637920000. Its totient is φ = 1000027425600.
The previous prime is 1386326128823. The next prime is 1386326128849. The reversal of 1386326128825 is 5288216236831.
It is not a de Polignac number, because 1386326128825 - 21 = 1386326128823 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is not an unprimeable number, because it can be changed into a prime (1386326128823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22336686 + ... + 22398664.
It is an arithmetic number, because the mean of its divisors is an integer number (39388290000).
Almost surely, 21386326128825 is an apocalyptic number.
It is an amenable number.
1386326128825 is a deficient number, since it is larger than the sum of its proper divisors (504311791175).
1386326128825 is a wasteful number, since it uses less digits than its factorization.
1386326128825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62662 (or 62657 counting only the distinct ones).
The product of its digits is 6635520, while the sum is 55.
It can be divided in two parts, 1386326 and 128825, that added together give a palindrome (1515151).
The spelling of 1386326128825 in words is "one trillion, three hundred eighty-six billion, three hundred twenty-six million, one hundred twenty-eight thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •