Base | Representation |
---|---|
bin | 1001101011011110110110… |
… | …1001110000010101001001 |
3 | 1101200102110120021110112111 |
4 | 2122313231221300111021 |
5 | 2343332042002410444 |
6 | 34345052550142321 |
7 | 2145622034033512 |
oct | 232675551602511 |
9 | 41612416243474 |
10 | 10642621138249 |
11 | 34335681a8611 |
12 | 123a7403519a1 |
13 | 5c2796bcc759 |
14 | 28b169b25a09 |
15 | 136c8b951234 |
hex | 9adeda70549 |
10642621138249 has 2 divisors, whose sum is σ = 10642621138250. Its totient is φ = 10642621138248.
The previous prime is 10642621138189. The next prime is 10642621138273. The reversal of 10642621138249 is 94283112624601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9865296782649 + 777324355600 = 3140907^2 + 881660^2 .
It is a cyclic number.
It is not a de Polignac number, because 10642621138249 - 221 = 10642619041097 is a prime.
It is a super-2 number, since 2×106426211382492 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10642621138549) 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, 5321310569124 + 5321310569125.
It is an arithmetic number, because the mean of its divisors is an integer number (5321310569125).
Almost surely, 210642621138249 is an apocalyptic number.
It is an amenable number.
10642621138249 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642621138249 is an equidigital number, since it uses as much as digits as its factorization.
10642621138249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 995328, while the sum is 49.
The spelling of 10642621138249 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, one hundred thirty-eight thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •