Base | Representation |
---|---|
bin | 100000110011010… |
… | …0101000010100100 |
3 | 2211201000220120121 |
4 | 1001212211002210 |
5 | 4223230212403 |
6 | 301114211324 |
7 | 36163135213 |
oct | 10146450244 |
9 | 2751026517 |
10 | 1100632228 |
11 | 515307313 |
12 | 268723b44 |
13 | 147042697 |
14 | a626507a |
15 | 6695d3bd |
hex | 419a50a4 |
1100632228 has 48 divisors (see below), whose sum is σ = 2062609920. Its totient is φ = 512400384.
The previous prime is 1100632223. The next prime is 1100632231. The reversal of 1100632228 is 8222360011.
It is a super-2 number, since 2×11006322282 = 2422782602624487968, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1100632223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1274925 + ... + 1275787.
It is an arithmetic number, because the mean of its divisors is an integer number (42971040).
Almost surely, 21100632228 is an apocalyptic number.
It is an amenable number.
1100632228 is a deficient number, since it is larger than the sum of its proper divisors (961977692).
1100632228 is a wasteful number, since it uses less digits than its factorization.
1100632228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156 (or 1154 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 1100632228 is about 33175.7777301452. Note that the first 4 decimals coincide. The cubic root of 1100632228 is about 1032.4778461830.
Adding to 1100632228 its reverse (8222360011), we get a palindrome (9322992239).
It can be divided in two parts, 11006 and 32228, that added together give a palindrome (43234).
The spelling of 1100632228 in words is "one billion, one hundred million, six hundred thirty-two thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •