Base | Representation |
---|---|
bin | 10000011010110111011… |
… | …111110101001100110001 |
3 | 10222212111100102100212222 |
4 | 100122313133311030301 |
5 | 121441340130201244 |
6 | 2222210022530425 |
7 | 144343545543044 |
oct | 20326737651461 |
9 | 3885440370788 |
10 | 1128360006449 |
11 | 3a5597897655 |
12 | 162825596a15 |
13 | 82533473990 |
14 | 3c881baac5b |
15 | 1e54062abee |
hex | 106b77f5331 |
1128360006449 has 4 divisors (see below), whose sum is σ = 1215156930036. Its totient is φ = 1041563082864.
The previous prime is 1128360006439. The next prime is 1128360006451. The reversal of 1128360006449 is 9446000638211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 511282201600 + 617077804849 = 715040^2 + 785543^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1128360006449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1128360006409) 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 3 ways as a sum of consecutive naturals, for example, 43398461774 + ... + 43398461799.
It is an arithmetic number, because the mean of its divisors is an integer number (303789232509).
Almost surely, 21128360006449 is an apocalyptic number.
It is an amenable number.
1128360006449 is a deficient number, since it is larger than the sum of its proper divisors (86796923587).
1128360006449 is an equidigital number, since it uses as much as digits as its factorization.
1128360006449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86796923586.
The product of its (nonzero) digits is 248832, while the sum is 44.
The spelling of 1128360006449 in words is "one trillion, one hundred twenty-eight billion, three hundred sixty million, six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •