Base | Representation |
---|---|
bin | 100000110010110… |
… | …1111110101110001 |
3 | 2211200121211122222 |
4 | 1001211233311301 |
5 | 4223201224241 |
6 | 301105410425 |
7 | 36161240006 |
oct | 10145576561 |
9 | 2750554588 |
10 | 1100414321 |
11 | 515178626 |
12 | 268639a15 |
13 | 146c97446 |
14 | a62098ad |
15 | 66918a4b |
hex | 4196fd71 |
1100414321 has 2 divisors, whose sum is σ = 1100414322. Its totient is φ = 1100414320.
The previous prime is 1100414281. The next prime is 1100414327. The reversal of 1100414321 is 1234140011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1060218721 + 40195600 = 32561^2 + 6340^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100414321 - 214 = 1100397937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1100414321.
It is not a weakly prime, because it can be changed into another prime (1100414327) 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 as a sum of consecutive naturals, namely, 550207160 + 550207161.
It is an arithmetic number, because the mean of its divisors is an integer number (550207161).
Almost surely, 21100414321 is an apocalyptic number.
It is an amenable number.
1100414321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100414321 is an equidigital number, since it uses as much as digits as its factorization.
1100414321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1100414321 is about 33172.4934395954. The cubic root of 1100414321 is about 1032.4097038330.
Adding to 1100414321 its reverse (1234140011), we get a palindrome (2334554332).
The spelling of 1100414321 in words is "one billion, one hundred million, four hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •