Base | Representation |
---|---|
bin | 10000100001111101100… |
… | …101000101110000001111 |
3 | 11000121011021110210002122 |
4 | 100201331211011300033 |
5 | 122102440412203124 |
6 | 2225510004043155 |
7 | 145033412505365 |
oct | 20417545056017 |
9 | 4017137423078 |
10 | 1135978241039 |
11 | 3a8847113aa4 |
12 | 1641b09934bb |
13 | 8317888b1b5 |
14 | 3cda5899635 |
15 | 1e83936575e |
hex | 1087d945c0f |
1135978241039 has 8 divisors (see below), whose sum is σ = 1147714692768. Its totient is φ = 1124242306560.
The previous prime is 1135978241033. The next prime is 1135978241081. The reversal of 1135978241039 is 9301428795311.
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 1135978241039 - 220 = 1135977192463 is a prime.
It is a super-2 number, since 2×11359782410392 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1135978241033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5581019 + ... + 5780979.
It is an arithmetic number, because the mean of its divisors is an integer number (143464336596).
Almost surely, 21135978241039 is an apocalyptic number.
1135978241039 is a deficient number, since it is larger than the sum of its proper divisors (11736451729).
1135978241039 is an equidigital number, since it uses as much as digits as its factorization.
1135978241039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258625.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 1135978241039 in words is "one trillion, one hundred thirty-five billion, nine hundred seventy-eight million, two hundred forty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •