Base | Representation |
---|---|
bin | 1001000110101011111000… |
… | …0111000101111111101001 |
3 | 1022102222202101211111121112 |
4 | 2101222332013011333221 |
5 | 2303002412103032111 |
6 | 33142424322320105 |
7 | 2052142420235351 |
oct | 221527607057751 |
9 | 38388671744545 |
10 | 10010463330281 |
11 | 320a460639a17 |
12 | 1158117ab9035 |
13 | 577ca0b2c00b |
14 | 26871aa1db61 |
15 | 1255dd823e8b |
hex | 91abe1c5fe9 |
10010463330281 has 2 divisors, whose sum is σ = 10010463330282. Its totient is φ = 10010463330280.
The previous prime is 10010463330269. The next prime is 10010463330289. The reversal of 10010463330281 is 18203336401001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9989013091600 + 21450238681 = 3160540^2 + 146459^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010463330281 is a prime.
It is a super-2 number, since 2×100104633302812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10010463330289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005231665140 + 5005231665141.
It is an arithmetic number, because the mean of its divisors is an integer number (5005231665141).
Almost surely, 210010463330281 is an apocalyptic number.
It is an amenable number.
10010463330281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010463330281 is an equidigital number, since it uses as much as digits as its factorization.
10010463330281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 10010463330281 its reverse (18203336401001), we get a palindrome (28213799731282).
The spelling of 10010463330281 in words is "ten trillion, ten billion, four hundred sixty-three million, three hundred thirty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •