Base | Representation |
---|---|
bin | 100001011101111… |
… | …1101001001010011 |
3 | 2220021010222111121 |
4 | 1002323331021103 |
5 | 4244442410303 |
6 | 303234023111 |
7 | 36554311654 |
oct | 10273751123 |
9 | 2807128447 |
10 | 1123013203 |
11 | 526a03494 |
12 | 274117a97 |
13 | 14b87a770 |
14 | a920d52b |
15 | 688ce9bd |
hex | 42efd253 |
1123013203 has 16 divisors (see below), whose sum is σ = 1277982720. Its totient is φ = 978984864.
The previous prime is 1123013201. The next prime is 1123013209. The reversal of 1123013203 is 3023103211.
It is not a de Polignac number, because 1123013203 - 21 = 1123013201 is a prime.
It is a super-2 number, since 2×11230132032 = 2522317308224638418, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123013201) 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 15 ways as a sum of consecutive naturals, for example, 151 + ... + 47392.
It is an arithmetic number, because the mean of its divisors is an integer number (79873920).
Almost surely, 21123013203 is an apocalyptic number.
1123013203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1123013203 is a deficient number, since it is larger than the sum of its proper divisors (154969517).
1123013203 is a wasteful number, since it uses less digits than its factorization.
1123013203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47658.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1123013203 is about 33511.3891535400. The cubic root of 1123013203 is about 1039.4292982620.
Adding to 1123013203 its reverse (3023103211), we get a palindrome (4146116414).
The spelling of 1123013203 in words is "one billion, one hundred twenty-three million, thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •