Base | Representation |
---|---|
bin | 110001100001000110… |
… | …0101111100010010001 |
3 | 101011110211110100011011 |
4 | 1203002030233202101 |
5 | 3220234324213231 |
6 | 120503430050521 |
7 | 10453065303061 |
oct | 1430214574221 |
9 | 334424410134 |
10 | 106337335441 |
11 | 41108721007 |
12 | 187381a9a41 |
13 | a04874907c |
14 | 520a9a13a1 |
15 | 2b757a89b1 |
hex | 18c232f891 |
106337335441 has 2 divisors, whose sum is σ = 106337335442. Its totient is φ = 106337335440.
The previous prime is 106337335417. The next prime is 106337335463. The reversal of 106337335441 is 144533733601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53694621841 + 52642713600 = 231721^2 + 229440^2 .
It is an emirp because it is prime and its reverse (144533733601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106337335441 - 223 = 106328946833 is a prime.
It is a super-2 number, since 2×1063373354412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106337335394 and 106337335403.
It is not a weakly prime, because it can be changed into another prime (106337335141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53168667720 + 53168667721.
It is an arithmetic number, because the mean of its divisors is an integer number (53168667721).
Almost surely, 2106337335441 is an apocalyptic number.
It is an amenable number.
106337335441 is a deficient number, since it is larger than the sum of its proper divisors (1).
106337335441 is an equidigital number, since it uses as much as digits as its factorization.
106337335441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 106337335441 in words is "one hundred six billion, three hundred thirty-seven million, three hundred thirty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •