Base | Representation |
---|---|
bin | 100001101111001… |
… | …0100010101101111 |
3 | 2220220002122000112 |
4 | 1003132110111233 |
5 | 4304244133403 |
6 | 304155050235 |
7 | 40024010033 |
oct | 10336242557 |
9 | 2826078015 |
10 | 1132021103 |
11 | 530aa6234 |
12 | 27714097b |
13 | 1506b2895 |
14 | aa4b61c3 |
15 | 695ad9d8 |
hex | 4379456f |
1132021103 has 8 divisors (see below), whose sum is σ = 1155368016. Its totient is φ = 1108828800.
The previous prime is 1132021097. The next prime is 1132021123. The reversal of 1132021103 is 3011202311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1132021103 - 28 = 1132020847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132021123) by changing a digit.
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, 23801 + ... + 53202.
It is an arithmetic number, because the mean of its divisors is an integer number (144421002).
Almost surely, 21132021103 is an apocalyptic number.
1132021103 is a deficient number, since it is larger than the sum of its proper divisors (23346913).
1132021103 is an equidigital number, since it uses as much as digits as its factorization.
1132021103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77305.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1132021103 is about 33645.5212918451. The cubic root of 1132021103 is about 1042.2010530931.
Adding to 1132021103 its reverse (3011202311), we get a palindrome (4143223414).
It can be divided in two parts, 11320 and 21103, that added together give a palindrome (32423).
The spelling of 1132021103 in words is "one billion, one hundred thirty-two million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •