Base | Representation |
---|---|
bin | 1001010100101011101111… |
… | …0101111010110000100001 |
3 | 1100021222110212120221000012 |
4 | 2111022323311322300201 |
5 | 2320422413010120303 |
6 | 33445115101534305 |
7 | 2105414635404554 |
oct | 225127365726041 |
9 | 40258425527005 |
10 | 10250943441953 |
11 | 32a2445371165 |
12 | 1196850274395 |
13 | 594876811196 |
14 | 276210d6869b |
15 | 12b9b59ba5d8 |
hex | 952bbd7ac21 |
10250943441953 has 2 divisors, whose sum is σ = 10250943441954. Its totient is φ = 10250943441952.
The previous prime is 10250943441917. The next prime is 10250943442009. The reversal of 10250943441953 is 35914434905201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6139408595089 + 4111534846864 = 2477783^2 + 2027692^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10250943441953 is a prime.
It is a super-3 number, since 3×102509434419533 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10250943443953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5125471720976 + 5125471720977.
It is an arithmetic number, because the mean of its divisors is an integer number (5125471720977).
Almost surely, 210250943441953 is an apocalyptic number.
It is an amenable number.
10250943441953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10250943441953 is an equidigital number, since it uses as much as digits as its factorization.
10250943441953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2332800, while the sum is 50.
The spelling of 10250943441953 in words is "ten trillion, two hundred fifty billion, nine hundred forty-three million, four hundred forty-one thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •