Base | Representation |
---|---|
bin | 101110001100110… |
… | …0000100110111111 |
3 | 11000000221212022221 |
4 | 1130121200212333 |
5 | 11133322103124 |
6 | 413453550211 |
7 | 53262256255 |
oct | 13431404677 |
9 | 4000855287 |
10 | 1550191039 |
11 | 726051521 |
12 | 3731a5367 |
13 | 1b9216607 |
14 | 109c4a5d5 |
15 | 91160ce4 |
hex | 5c6609bf |
1550191039 has 2 divisors, whose sum is σ = 1550191040. Its totient is φ = 1550191038.
The previous prime is 1550191003. The next prime is 1550191073. The reversal of 1550191039 is 9301910551.
It is an a-pointer prime, because the next prime (1550191073) can be obtained adding 1550191039 to its sum of digits (34).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1550191039 - 221 = 1548093887 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1550190995 and 1550191013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1550191439) 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, 775095519 + 775095520.
It is an arithmetic number, because the mean of its divisors is an integer number (775095520).
Almost surely, 21550191039 is an apocalyptic number.
1550191039 is a deficient number, since it is larger than the sum of its proper divisors (1).
1550191039 is an equidigital number, since it uses as much as digits as its factorization.
1550191039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6075, while the sum is 34.
The square root of 1550191039 is about 39372.4654930321. The cubic root of 1550191039 is about 1157.3420711999.
The spelling of 1550191039 in words is "one billion, five hundred fifty million, one hundred ninety-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •