Base | Representation |
---|---|
bin | 110001100011010001… |
… | …0001001011010100101 |
3 | 101011122220021220002111 |
4 | 1203012202021122211 |
5 | 3220411433232313 |
6 | 120514544441021 |
7 | 10454640355321 |
oct | 1430642113245 |
9 | 334586256074 |
10 | 106410055333 |
11 | 4114577a59a |
12 | 18758619171 |
13 | a05a82a8aa |
14 | 52164d0981 |
15 | 2b7bd7043d |
hex | 18c68896a5 |
106410055333 has 2 divisors, whose sum is σ = 106410055334. Its totient is φ = 106410055332.
The previous prime is 106410055319. The next prime is 106410055363. The reversal of 106410055333 is 333550014601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96278022369 + 10132032964 = 310287^2 + 100658^2 .
It is a cyclic number.
It is not a de Polignac number, because 106410055333 - 229 = 105873184421 is a prime.
It is a super-2 number, since 2×1064100553332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106410055295 and 106410055304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106410055363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53205027666 + 53205027667.
It is an arithmetic number, because the mean of its divisors is an integer number (53205027667).
Almost surely, 2106410055333 is an apocalyptic number.
It is an amenable number.
106410055333 is a deficient number, since it is larger than the sum of its proper divisors (1).
106410055333 is an equidigital number, since it uses as much as digits as its factorization.
106410055333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 106410055333 its reverse (333550014601), we get a palindrome (439960069934).
The spelling of 106410055333 in words is "one hundred six billion, four hundred ten million, fifty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •