Base | Representation |
---|---|
bin | 111100001011001… |
… | …000001100111101 |
3 | 2121100122110102222 |
4 | 330023020030331 |
5 | 4031421101031 |
6 | 244102055125 |
7 | 34006014605 |
oct | 7413101475 |
9 | 2540573388 |
10 | 1009550141 |
11 | 478956a66 |
12 | 24211a4a5 |
13 | 131202062 |
14 | 98115c05 |
15 | 5d96ae7b |
hex | 3c2c833d |
1009550141 has 2 divisors, whose sum is σ = 1009550142. Its totient is φ = 1009550140.
The previous prime is 1009550137. The next prime is 1009550147. The reversal of 1009550141 is 1410559001.
1009550141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 734952100 + 274598041 = 27110^2 + 16571^2 .
It is a cyclic number.
It is not a de Polignac number, because 1009550141 - 22 = 1009550137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1009550141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1009550147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 504775070 + 504775071.
It is an arithmetic number, because the mean of its divisors is an integer number (504775071).
Almost surely, 21009550141 is an apocalyptic number.
It is an amenable number.
1009550141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1009550141 is an equidigital number, since it uses as much as digits as its factorization.
1009550141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 26.
The square root of 1009550141 is about 31773.4187804838. The cubic root of 1009550141 is about 1003.1732998499.
The spelling of 1009550141 in words is "one billion, nine million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •