Base | Representation |
---|---|
bin | 10000010101111010101… |
… | …001000000111000010011 |
3 | 10222100202212111002111211 |
4 | 100111322221000320103 |
5 | 121344443233123430 |
6 | 2215530323120551 |
7 | 144065035542211 |
oct | 20257251007023 |
9 | 3870685432454 |
10 | 1123044036115 |
11 | 3a330a098441 |
12 | 1617a1213157 |
13 | 81b970150c1 |
14 | 3c4d9b79cb1 |
15 | 1e32daad72a |
hex | 1057aa40e13 |
1123044036115 has 8 divisors (see below), whose sum is σ = 1347850981008. Its totient is φ = 898303137120.
The previous prime is 1123044036097. The next prime is 1123044036119. The reversal of 1123044036115 is 5116304403211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1123044036115 - 229 = 1122507165203 is a prime.
It is a super-2 number, since 2×11230440361152 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123044036119) by changing a digit.
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, 16474056 + ... + 16542085.
It is an arithmetic number, because the mean of its divisors is an integer number (168481372626).
Almost surely, 21123044036115 is an apocalyptic number.
1123044036115 is a deficient number, since it is larger than the sum of its proper divisors (224806944893).
1123044036115 is an equidigital number, since it uses as much as digits as its factorization.
1123044036115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33022949.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 1123044036115 its reverse (5116304403211), we get a palindrome (6239348439326).
The spelling of 1123044036115 in words is "one trillion, one hundred twenty-three billion, forty-four million, thirty-six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •