Base | Representation |
---|---|
bin | 100000110010001… |
… | …0100111110001001 |
3 | 2211122220221002210 |
4 | 1001210110332021 |
5 | 4223102321441 |
6 | 301053415333 |
7 | 36155126613 |
oct | 10144247611 |
9 | 2748827083 |
10 | 1100042121 |
11 | 514a43a22 |
12 | 26849a549 |
13 | 146b96bc9 |
14 | a614ddb3 |
15 | 66893616 |
hex | 41914f89 |
1100042121 has 8 divisors (see below), whose sum is σ = 1487381184. Its totient is φ = 723032240.
The previous prime is 1100042063. The next prime is 1100042131. The reversal of 1100042121 is 1212400011.
It is a happy number.
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 1100042121 - 214 = 1100025737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100042097 and 1100042106.
It is not an unprimeable number, because it can be changed into a prime (1100042131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2582046 + ... + 2582471.
It is an arithmetic number, because the mean of its divisors is an integer number (185922648).
Almost surely, 21100042121 is an apocalyptic number.
It is an amenable number.
1100042121 is a deficient number, since it is larger than the sum of its proper divisors (387339063).
1100042121 is an equidigital number, since it uses as much as digits as its factorization.
1100042121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5164591.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1100042121 is about 33166.8828954426. The cubic root of 1100042121 is about 1032.2932912490.
Adding to 1100042121 its reverse (1212400011), we get a palindrome (2312442132).
The spelling of 1100042121 in words is "one billion, one hundred million, forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •