Base | Representation |
---|---|
bin | 100001011101111… |
… | …1101101010100010 |
3 | 2220021011002102101 |
4 | 1002323331222202 |
5 | 4244442442310 |
6 | 303234041014 |
7 | 36554321113 |
oct | 10273755242 |
9 | 2807132371 |
10 | 1123015330 |
11 | 526a05048 |
12 | 27411916a |
13 | 14b87b718 |
14 | a921020a |
15 | 688d043a |
hex | 42efdaa2 |
1123015330 has 16 divisors (see below), whose sum is σ = 2127818880. Its totient is φ = 425563632.
The previous prime is 1123015301. The next prime is 1123015367. The reversal of 1123015330 is 335103211.
It is a super-2 number, since 2×11230153302 = 2522326862830017800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1123015298 and 1123015307.
It is an unprimeable number.
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, 2955114 + ... + 2955493.
It is an arithmetic number, because the mean of its divisors is an integer number (132988680).
Almost surely, 21123015330 is an apocalyptic number.
1123015330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1123015330 is a deficient number, since it is larger than the sum of its proper divisors (1004803550).
1123015330 is a wasteful number, since it uses less digits than its factorization.
1123015330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5910633.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1123015330 is about 33511.4208890044. The cubic root of 1123015330 is about 1039.4299544919.
Adding to 1123015330 its reverse (335103211), we get a palindrome (1458118541).
The spelling of 1123015330 in words is "one billion, one hundred twenty-three million, fifteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •