Base | Representation |
---|---|
bin | 10011111010101011110… |
… | …100011001100110101001 |
3 | 11211211210211002202210120 |
4 | 103322223310121212221 |
5 | 134411030123143200 |
6 | 2524433002233453 |
7 | 200612136042363 |
oct | 23725364314651 |
9 | 4754724082716 |
10 | 1368682240425 |
11 | 488500496a65 |
12 | 1a1314ab5889 |
13 | 9c0b25293a6 |
14 | 4a35d179d33 |
15 | 259089d89a0 |
hex | 13eabd199a9 |
1368682240425 has 192 divisors, whose sum is σ = 2551336704000. Its totient is φ = 644149596160.
The previous prime is 1368682240423. The next prime is 1368682240433. The reversal of 1368682240425 is 5240422868631.
It is not a de Polignac number, because 1368682240425 - 21 = 1368682240423 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (1368682240421) 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 191 ways as a sum of consecutive naturals, for example, 181062796 + ... + 181070354.
It is an arithmetic number, because the mean of its divisors is an integer number (13288212000).
Almost surely, 21368682240425 is an apocalyptic number.
1368682240425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1368682240425 is a deficient number, since it is larger than the sum of its proper divisors (1182654463575).
1368682240425 is a wasteful number, since it uses less digits than its factorization.
1368682240425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7760 (or 7755 counting only the distinct ones).
The product of its (nonzero) digits is 4423680, while the sum is 51.
The spelling of 1368682240425 in words is "one trillion, three hundred sixty-eight billion, six hundred eighty-two million, two hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •