Base | Representation |
---|---|
bin | 100000111000001… |
… | …1101100011110110 |
3 | 2211212220112111020 |
4 | 1001300131203312 |
5 | 4224411114110 |
6 | 301245522010 |
7 | 36224145450 |
oct | 10160354366 |
9 | 2755815436 |
10 | 1103223030 |
11 | 516816878 |
12 | 269573306 |
13 | 14773b9c0 |
14 | a673b2d0 |
15 | 66cc0d70 |
hex | 41c1d8f6 |
1103223030 has 128 divisors (see below), whose sum is σ = 3430425600. Its totient is φ = 220506624.
The previous prime is 1103223019. The next prime is 1103223053. The reversal of 1103223030 is 303223011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 41236 + ... + 62504.
It is an arithmetic number, because the mean of its divisors is an integer number (26800200).
Almost surely, 21103223030 is an apocalyptic number.
1103223030 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 1103223030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1715212800).
1103223030 is an abundant number, since it is smaller than the sum of its proper divisors (2327202570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103223030 is a wasteful number, since it uses less digits than its factorization.
1103223030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21318.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 1103223030 is about 33214.8013692691. The cubic root of 1103223030 is about 1033.2873353325.
Adding to 1103223030 its reverse (303223011), we get a palindrome (1406446041).
The spelling of 1103223030 in words is "one billion, one hundred three million, two hundred twenty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •