Base | Representation |
---|---|
bin | 1001101011111100101010… |
… | …1111010101110010101001 |
3 | 1101201012010101120202112022 |
4 | 2122333022233111302221 |
5 | 2343444440041200231 |
6 | 34352455115554225 |
7 | 2146324265421461 |
oct | 232771257256251 |
9 | 41635111522468 |
10 | 10650625334441 |
11 | 34369a5381694 |
12 | 12401b4a5b975 |
13 | 5c3471281811 |
14 | 28b6c8ba2ba1 |
15 | 1370a94c9c7b |
hex | 9afcabd5ca9 |
10650625334441 has 2 divisors, whose sum is σ = 10650625334442. Its totient is φ = 10650625334440.
The previous prime is 10650625334329. The next prime is 10650625334473. The reversal of 10650625334441 is 14443352605601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9819474028816 + 831151305625 = 3133604^2 + 911675^2 .
It is a cyclic number.
It is not a de Polignac number, because 10650625334441 - 238 = 10375747427497 is a prime.
It is a super-2 number, since 2×106506253344412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10650625334392 and 10650625334401.
It is not a weakly prime, because it can be changed into another prime (10650625334941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5325312667220 + 5325312667221.
It is an arithmetic number, because the mean of its divisors is an integer number (5325312667221).
Almost surely, 210650625334441 is an apocalyptic number.
It is an amenable number.
10650625334441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10650625334441 is an equidigital number, since it uses as much as digits as its factorization.
10650625334441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1036800, while the sum is 44.
The spelling of 10650625334441 in words is "ten trillion, six hundred fifty billion, six hundred twenty-five million, three hundred thirty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •