Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …110111100101111110101 |
3 | 10222012022020212211221102 |
4 | 100110103132330233311 |
5 | 121332422204011001 |
6 | 2215042500255445 |
7 | 144004122111110 |
oct | 20242336745765 |
9 | 3865266784842 |
10 | 1121313344501 |
11 | 3a2601172199 |
12 | 1613996a1585 |
13 | 8197c5b0b1c |
14 | 3c3b3d85577 |
15 | 1e27bb95e6b |
hex | 105137bcbf5 |
1121313344501 has 8 divisors (see below), whose sum is σ = 1281841729344. Its totient is φ = 960870150720.
The previous prime is 1121313344453. The next prime is 1121313344509. The reversal of 1121313344501 is 1054433131211.
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 1121313344501 - 238 = 846435437557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121313344509) 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 7 ways as a sum of consecutive naturals, for example, 21269555 + ... + 21322208.
It is an arithmetic number, because the mean of its divisors is an integer number (160230216168).
Almost surely, 21121313344501 is an apocalyptic number.
It is an amenable number.
1121313344501 is a deficient number, since it is larger than the sum of its proper divisors (160528384843).
1121313344501 is an equidigital number, since it uses as much as digits as its factorization.
1121313344501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42595531.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 1121313344501 its reverse (1054433131211), we get a palindrome (2175746475712).
The spelling of 1121313344501 in words is "one trillion, one hundred twenty-one billion, three hundred thirteen million, three hundred forty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •