Base | Representation |
---|---|
bin | 110001011110111100… |
… | …0011110100101000001 |
3 | 101011021210011221221111 |
4 | 1202331320132211001 |
5 | 3220112304223431 |
6 | 120452321523321 |
7 | 10451225603413 |
oct | 1427570364501 |
9 | 334253157844 |
10 | 106264914241 |
11 | 41080856982 |
12 | 18717aa3541 |
13 | a0367404a5 |
14 | 520110c9b3 |
15 | 2b6e2507b1 |
hex | 18bde1e941 |
106264914241 has 2 divisors, whose sum is σ = 106264914242. Its totient is φ = 106264914240.
The previous prime is 106264914221. The next prime is 106264914319. The reversal of 106264914241 is 142419462601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58126799025 + 48138115216 = 241095^2 + 219404^2 .
It is a cyclic number.
It is not a de Polignac number, because 106264914241 - 213 = 106264906049 is a prime.
It is a super-2 number, since 2×1062649142412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106264914194 and 106264914203.
It is not a weakly prime, because it can be changed into another prime (106264914211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53132457120 + 53132457121.
It is an arithmetic number, because the mean of its divisors is an integer number (53132457121).
Almost surely, 2106264914241 is an apocalyptic number.
It is an amenable number.
106264914241 is a deficient number, since it is larger than the sum of its proper divisors (1).
106264914241 is an equidigital number, since it uses as much as digits as its factorization.
106264914241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 40.
The spelling of 106264914241 in words is "one hundred six billion, two hundred sixty-four million, nine hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •