Base | Representation |
---|---|
bin | 100001011101111… |
… | …1010000011010010 |
3 | 2220021010100010020 |
4 | 1002323322003102 |
5 | 4244442004110 |
6 | 303233444310 |
7 | 36554230011 |
oct | 10273720322 |
9 | 2807110106 |
10 | 1123000530 |
11 | 5269a4a13 |
12 | 274110696 |
13 | 14b874a72 |
14 | a9208a78 |
15 | 688cad70 |
hex | 42efa0d2 |
1123000530 has 32 divisors (see below), whose sum is σ = 2812385664. Its totient is φ = 286446336.
The previous prime is 1123000477. The next prime is 1123000531. The reversal of 1123000530 is 350003211.
It is a happy number.
It is a super-2 number, since 2×11230005302 = 2522260380760561800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1123000531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 813079 + ... + 814458.
It is an arithmetic number, because the mean of its divisors is an integer number (87887052).
Almost surely, 21123000530 is an apocalyptic number.
1123000530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1123000530 is an abundant number, since it is smaller than the sum of its proper divisors (1689385134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123000530 is a wasteful number, since it uses less digits than its factorization.
1123000530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1627570.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 1123000530 is about 33511.2000680370. The cubic root of 1123000530 is about 1039.4253883236.
Adding to 1123000530 its reverse (350003211), we get a palindrome (1473003741).
The spelling of 1123000530 in words is "one billion, one hundred twenty-three million, five hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •