Base | Representation |
---|---|
bin | 111000101000000… |
… | …000110110011101 |
3 | 2110012121200022022 |
4 | 320220000312131 |
5 | 3421200411331 |
6 | 234134025525 |
7 | 32353660124 |
oct | 7050006635 |
9 | 2405550268 |
10 | 950013341 |
11 | 4482920a2 |
12 | 2261a82a5 |
13 | 121a87b94 |
14 | 90258abb |
15 | 5860a67b |
hex | 38a00d9d |
950013341 has 2 divisors, whose sum is σ = 950013342. Its totient is φ = 950013340.
The previous prime is 950013331. The next prime is 950013461. The reversal of 950013341 is 143310059.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 754600900 + 195412441 = 27470^2 + 13979^2 .
It is a cyclic number.
It is not a de Polignac number, because 950013341 - 26 = 950013277 is a prime.
It is a super-3 number, since 3×9500133413 (a number of 28 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 950013341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (950013331) 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, 475006670 + 475006671.
It is an arithmetic number, because the mean of its divisors is an integer number (475006671).
Almost surely, 2950013341 is an apocalyptic number.
It is an amenable number.
950013341 is a deficient number, since it is larger than the sum of its proper divisors (1).
950013341 is an equidigital number, since it uses as much as digits as its factorization.
950013341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 950013341 is about 30822.2864336830. The cubic root of 950013341 is about 983.0521741674.
The spelling of 950013341 in words is "nine hundred fifty million, thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •