Base | Representation |
---|---|
bin | 100000111001110… |
… | …1011011011001011 |
3 | 2211221111101011122 |
4 | 1001303223123023 |
5 | 4230120110001 |
6 | 301315545455 |
7 | 36234260021 |
oct | 10163533313 |
9 | 2757441148 |
10 | 1104066251 |
11 | 517242352 |
12 | 2698bb28b |
13 | 147975752 |
14 | a68ba711 |
15 | 66ddab1b |
hex | 41ceb6cb |
1104066251 has 2 divisors, whose sum is σ = 1104066252. Its totient is φ = 1104066250.
The previous prime is 1104066239. The next prime is 1104066277. The reversal of 1104066251 is 1526604011.
It is an a-pointer prime, because the next prime (1104066277) can be obtained adding 1104066251 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (1526604011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1104066251 - 226 = 1036957387 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1104066251.
It is not a weakly prime, because it can be changed into another prime (1104066211) 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, 552033125 + 552033126.
It is an arithmetic number, because the mean of its divisors is an integer number (552033126).
Almost surely, 21104066251 is an apocalyptic number.
1104066251 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104066251 is an equidigital number, since it uses as much as digits as its factorization.
1104066251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 1104066251 is about 33227.4923971100. The cubic root of 1104066251 is about 1033.5505240888.
The spelling of 1104066251 in words is "one billion, one hundred four million, sixty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •