Base | Representation |
---|---|
bin | 11011100111111010001… |
… | …00001010101010110001 |
3 | 10100201220002121012100112 |
4 | 31303331010022222301 |
5 | 111022313431024131 |
6 | 2004010032431105 |
7 | 125400352262546 |
oct | 15637504125261 |
9 | 3321802535315 |
10 | 949138533041 |
11 | 336588a59a86 |
12 | 133b486a8495 |
13 | 6b670c0436a |
14 | 33d1d54abcd |
15 | 19a5145702b |
hex | dcfd10aab1 |
949138533041 has 2 divisors, whose sum is σ = 949138533042. Its totient is φ = 949138533040.
The previous prime is 949138533029. The next prime is 949138533047. The reversal of 949138533041 is 140335831949.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 919028995600 + 30109537441 = 958660^2 + 173521^2 .
It is a cyclic number.
It is not a de Polignac number, because 949138533041 - 214 = 949138516657 is a prime.
It is not a weakly prime, because it can be changed into another prime (949138533047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 474569266520 + 474569266521.
It is an arithmetic number, because the mean of its divisors is an integer number (474569266521).
Almost surely, 2949138533041 is an apocalyptic number.
It is an amenable number.
949138533041 is a deficient number, since it is larger than the sum of its proper divisors (1).
949138533041 is an equidigital number, since it uses as much as digits as its factorization.
949138533041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 949138533041 in words is "nine hundred forty-nine billion, one hundred thirty-eight million, five hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •