Base | Representation |
---|---|
bin | 11110100100101101111… |
… | …10100101101101111001 |
3 | 10201102112111111202122111 |
4 | 33102112332211231321 |
5 | 114202413240310131 |
6 | 2122332332052321 |
7 | 135616331153164 |
oct | 17222676455571 |
9 | 3642474452574 |
10 | 1050505010041 |
11 | 375575767513 |
12 | 14b7180040a1 |
13 | 780a6855b76 |
14 | 38bb7c74adb |
15 | 1c4d5613ab1 |
hex | f496fa5b79 |
1050505010041 has 2 divisors, whose sum is σ = 1050505010042. Its totient is φ = 1050505010040.
The previous prime is 1050505009979. The next prime is 1050505010081. The reversal of 1050505010041 is 1400105050501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1045179075600 + 5325934441 = 1022340^2 + 72979^2 .
It is an emirp because it is prime and its reverse (1400105050501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050505010041 - 233 = 1041915075449 is a prime.
It is a super-2 number, since 2×10505050100412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050505009994 and 1050505010021.
It is not a weakly prime, because it can be changed into another prime (1050505010081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525252505020 + 525252505021.
It is an arithmetic number, because the mean of its divisors is an integer number (525252505021).
Almost surely, 21050505010041 is an apocalyptic number.
It is an amenable number.
1050505010041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050505010041 is an equidigital number, since it uses as much as digits as its factorization.
1050505010041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 500, while the sum is 22.
The spelling of 1050505010041 in words is "one trillion, fifty billion, five hundred five million, ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •