Base | Representation |
---|---|
bin | 100000111000000… |
… | …1010010100011111 |
3 | 2211212202112101110 |
4 | 1001300022110133 |
5 | 4224401103343 |
6 | 301244113103 |
7 | 36223366626 |
oct | 10160122437 |
9 | 2755675343 |
10 | 1103144223 |
11 | 516772645 |
12 | 269535793 |
13 | 147711b7c |
14 | a671a6bd |
15 | 66ca7833 |
hex | 41c0a51f |
1103144223 has 8 divisors (see below), whose sum is σ = 1474211200. Its totient is φ = 733753368.
The previous prime is 1103144221. The next prime is 1103144227. The reversal of 1103144223 is 3224413011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1103144223 - 21 = 1103144221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1103144223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103144221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 417493 + ... + 420126.
It is an arithmetic number, because the mean of its divisors is an integer number (184276400).
Almost surely, 21103144223 is an apocalyptic number.
1103144223 is a deficient number, since it is larger than the sum of its proper divisors (371066977).
1103144223 is an equidigital number, since it uses as much as digits as its factorization.
1103144223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838061.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1103144223 is about 33213.6150245649. The cubic root of 1103144223 is about 1033.2627309954.
Adding to 1103144223 its reverse (3224413011), we get a palindrome (4327557234).
The spelling of 1103144223 in words is "one billion, one hundred three million, one hundred forty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •