Base | Representation |
---|---|
bin | 10000100001001111001… |
… | …100100010111101110001 |
3 | 11000112011001011211202011 |
4 | 100201033030202331301 |
5 | 122044342203231103 |
6 | 2225300444522521 |
7 | 145005213155023 |
oct | 20411714427561 |
9 | 4015131154664 |
10 | 1135200055153 |
11 | 3a848792246a |
12 | 164014250441 |
13 | 830835a5388 |
14 | 3cd303ac013 |
15 | 1e7e0d9bd6d |
hex | 1084f322f71 |
1135200055153 has 8 divisors (see below), whose sum is σ = 1141502799528. Its totient is φ = 1128909538944.
The previous prime is 1135200055147. The next prime is 1135200055183. The reversal of 1135200055153 is 3515500025311.
It can be written as a sum of positive squares in 4 ways, for example, as 271214933089 + 863985122064 = 520783^2 + 929508^2 .
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 1135200055153 - 29 = 1135200054641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1135200055183) 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, 2870826 + ... + 3242227.
It is an arithmetic number, because the mean of its divisors is an integer number (142687849941).
Almost surely, 21135200055153 is an apocalyptic number.
It is an amenable number.
1135200055153 is a deficient number, since it is larger than the sum of its proper divisors (6302744375).
1135200055153 is an equidigital number, since it uses as much as digits as its factorization.
1135200055153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6114083.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 1135200055153 in words is "one trillion, one hundred thirty-five billion, two hundred million, fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •