Base | Representation |
---|---|
bin | 100001011101111… |
… | …1100111011100011 |
3 | 2220021010221022000 |
4 | 1002323330323203 |
5 | 4244442343243 |
6 | 303234015043 |
7 | 36554306256 |
oct | 10273747343 |
9 | 2807127260 |
10 | 1123012323 |
11 | 526a02864 |
12 | 274117483 |
13 | 14b87a244 |
14 | a920d09d |
15 | 688ce5d3 |
hex | 42efcee3 |
1123012323 has 16 divisors (see below), whose sum is σ = 1669917600. Its totient is φ = 745886880.
The previous prime is 1123012291. The next prime is 1123012337. The reversal of 1123012323 is 3232103211.
It is not a de Polignac number, because 1123012323 - 25 = 1123012291 is a prime.
It is a super-2 number, since 2×11230123232 = 2522313355219712658, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123012296 and 1123012305.
It is not an unprimeable number, because it can be changed into a prime (1123019323) 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 15 ways as a sum of consecutive naturals, for example, 70048 + ... + 84573.
It is an arithmetic number, because the mean of its divisors is an integer number (104369850).
Almost surely, 21123012323 is an apocalyptic number.
1123012323 is a deficient number, since it is larger than the sum of its proper divisors (546905277).
1123012323 is a wasteful number, since it uses less digits than its factorization.
1123012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154899 (or 154893 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1123012323 is about 33511.3760236729. The cubic root of 1123012323 is about 1039.4290267608.
Adding to 1123012323 its reverse (3232103211), we get a palindrome (4355115534).
The spelling of 1123012323 in words is "one billion, one hundred twenty-three million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •