Base | Representation |
---|---|
bin | 10000100011001000110… |
… | …011001100000001111101 |
3 | 11000201102020010100201011 |
4 | 100203020303030001331 |
5 | 122113031444243330 |
6 | 2230235124515221 |
7 | 145106605304512 |
oct | 20431063140175 |
9 | 4021366110634 |
10 | 1137240227965 |
11 | 3a93345084a6 |
12 | 1644a354bb11 |
13 | 8331a176b1a |
14 | 3d085323309 |
15 | 1e8b004782a |
hex | 108c8ccc07d |
1137240227965 has 8 divisors (see below), whose sum is σ = 1393724194560. Its totient is φ = 890434901712.
The previous prime is 1137240227927. The next prime is 1137240227987. The reversal of 1137240227965 is 5697220427311.
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 1137240227965 - 233 = 1128650293373 is a prime.
It is a super-2 number, since 2×11372402279652 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 2419659825 + ... + 2419660294.
It is an arithmetic number, because the mean of its divisors is an integer number (174215524320).
Almost surely, 21137240227965 is an apocalyptic number.
It is an amenable number.
1137240227965 is a deficient number, since it is larger than the sum of its proper divisors (256483966595).
1137240227965 is an equidigital number, since it uses as much as digits as its factorization.
1137240227965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4839320171.
The product of its (nonzero) digits is 1270080, while the sum is 49.
The spelling of 1137240227965 in words is "one trillion, one hundred thirty-seven billion, two hundred forty million, two hundred twenty-seven thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.526 sec. • engine limits •