Base | Representation |
---|---|
bin | 10000010101100000100… |
… | …111010101010000001111 |
3 | 10222022122102212001102221 |
4 | 100111200213111100033 |
5 | 121343044442401123 |
6 | 2215415124200211 |
7 | 144051154231516 |
oct | 20254047252017 |
9 | 3868572761387 |
10 | 1122607387663 |
11 | 3a3105670a53 |
12 | 16169ab39067 |
13 | 81b27711638 |
14 | 3c497b9567d |
15 | 1e3055ab25d |
hex | 105609d540f |
1122607387663 has 8 divisors (see below), whose sum is σ = 1136839898880. Its totient is φ = 1108375433880.
The previous prime is 1122607387613. The next prime is 1122607387687. The reversal of 1122607387663 is 3667837062211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1122607387663 - 237 = 985168434191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1122607387663.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122607387613) 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, 5203956 + ... + 5415382.
It is an arithmetic number, because the mean of its divisors is an integer number (142104987360).
Almost surely, 21122607387663 is an apocalyptic number.
1122607387663 is a deficient number, since it is larger than the sum of its proper divisors (14232511217).
1122607387663 is an equidigital number, since it uses as much as digits as its factorization.
1122607387663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278717.
The product of its (nonzero) digits is 3048192, while the sum is 52.
The spelling of 1122607387663 in words is "one trillion, one hundred twenty-two billion, six hundred seven million, three hundred eighty-seven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •