Base | Representation |
---|---|
bin | 11101000100010111001… |
… | …011101101011010100111 |
3 | 21001222000121100211221120 |
4 | 131010113023231122213 |
5 | 230211434434110330 |
6 | 4125354453545023 |
7 | 264214056060162 |
oct | 35042713553247 |
9 | 7058017324846 |
10 | 1997548738215 |
11 | 7001792065a8 |
12 | 28317b045173 |
13 | 1164a276ac04 |
14 | 6c9790c8ad9 |
15 | 36e62bccc10 |
hex | 1d1172ed6a7 |
1997548738215 has 16 divisors (see below), whose sum is σ = 3196098836448. Its totient is φ = 1065352375296.
The previous prime is 1997548738169. The next prime is 1997548738219. The reversal of 1997548738215 is 5128378457991.
It is a happy number.
It is not a de Polignac number, because 1997548738215 - 29 = 1997548737703 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1997548738215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1997548738219) 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 15 ways as a sum of consecutive naturals, for example, 2644947 + ... + 3315243.
It is an arithmetic number, because the mean of its divisors is an integer number (199756177278).
Almost surely, 21997548738215 is an apocalyptic number.
1997548738215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1997548738215 is a deficient number, since it is larger than the sum of its proper divisors (1198550098233).
1997548738215 is a wasteful number, since it uses less digits than its factorization.
1997548738215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868978.
The product of its digits is 152409600, while the sum is 69.
The spelling of 1997548738215 in words is "one trillion, nine hundred ninety-seven billion, five hundred forty-eight million, seven hundred thirty-eight thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •