Base | Representation |
---|---|
bin | 100000111010001… |
… | …0011011010000101 |
3 | 2211221210200211012 |
4 | 1001310103122011 |
5 | 4230140330041 |
6 | 301323252005 |
7 | 36235541336 |
oct | 10164233205 |
9 | 2757720735 |
10 | 1104230021 |
11 | 5173443a4 |
12 | 26997a005 |
13 | 147a0215b |
14 | a692028d |
15 | 66e1e3eb |
hex | 41d13685 |
1104230021 has 2 divisors, whose sum is σ = 1104230022. Its totient is φ = 1104230020.
The previous prime is 1104229969. The next prime is 1104230033. The reversal of 1104230021 is 1200324011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1071580225 + 32649796 = 32735^2 + 5714^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104230021 - 26 = 1104229957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104229978 and 1104230005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104230041) 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 as a sum of consecutive naturals, namely, 552115010 + 552115011.
It is an arithmetic number, because the mean of its divisors is an integer number (552115011).
Almost surely, 21104230021 is an apocalyptic number.
It is an amenable number.
1104230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104230021 is an equidigital number, since it uses as much as digits as its factorization.
1104230021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1104230021 is about 33229.9566806820. The cubic root of 1104230021 is about 1033.6016249476.
Adding to 1104230021 its reverse (1200324011), we get a palindrome (2304554032).
The spelling of 1104230021 in words is "one billion, one hundred four million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •