Base | Representation |
---|---|
bin | 100001011110100… |
… | …0011101010001110 |
3 | 2220021200122200220 |
4 | 1002331003222032 |
5 | 4300031131110 |
6 | 303244132210 |
7 | 36556624014 |
oct | 10275035216 |
9 | 2807618626 |
10 | 1123302030 |
11 | 527090494 |
12 | 274237066 |
13 | 14b94c076 |
14 | a92868b4 |
15 | 6893a370 |
hex | 42f43a8e |
1123302030 has 64 divisors (see below), whose sum is σ = 2872895040. Its totient is φ = 280111104.
The previous prime is 1123302017. The next prime is 1123302049. The reversal of 1123302030 is 302033211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73056 + ... + 87084.
It is an arithmetic number, because the mean of its divisors is an integer number (44888985).
Almost surely, 21123302030 is an apocalyptic number.
1123302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1123302030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1436447520).
1123302030 is an abundant number, since it is smaller than the sum of its proper divisors (1749593010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123302030 is a wasteful number, since it uses less digits than its factorization.
1123302030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14213.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 1123302030 is about 33515.6982621577. The cubic root of 1123302030 is about 1039.5184006612.
Adding to 1123302030 its reverse (302033211), we get a palindrome (1425335241).
The spelling of 1123302030 in words is "one billion, one hundred twenty-three million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •