Base | Representation |
---|---|
bin | 11000001101010000010… |
… | …101110100110101000001 |
3 | 12220000210012012000102000 |
4 | 120031100111310311001 |
5 | 204223322030222431 |
6 | 3312111303214213 |
7 | 231120041520435 |
oct | 30152025646501 |
9 | 5800705160360 |
10 | 1663500242241 |
11 | 591539579332 |
12 | 22a492a47369 |
13 | c0b378a5b86 |
14 | 5a729da29c5 |
15 | 2d4112909e6 |
hex | 18350574d41 |
1663500242241 has 8 divisors (see below), whose sum is σ = 2464444803360. Its totient is φ = 1109000161476.
The previous prime is 1663500242207. The next prime is 1663500242269. The reversal of 1663500242241 is 1422420053661.
1663500242241 is a `hidden beast` number, since 1 + 66 + 350 + 0 + 2 + 4 + 2 + 241 = 666.
It is not a de Polignac number, because 1663500242241 - 215 = 1663500209473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1663500242196 and 1663500242205.
It is not an unprimeable number, because it can be changed into a prime (1663500242291) 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, 30805560015 + ... + 30805560068.
It is an arithmetic number, because the mean of its divisors is an integer number (308055600420).
Almost surely, 21663500242241 is an apocalyptic number.
It is an amenable number.
1663500242241 is a deficient number, since it is larger than the sum of its proper divisors (800944561119).
1663500242241 is an equidigital number, since it uses as much as digits as its factorization.
1663500242241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61611120092 (or 61611120086 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 1663500242241 in words is "one trillion, six hundred sixty-three billion, five hundred million, two hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •