Base | Representation |
---|---|
bin | 110001011000110111… |
… | …1100111001011111101 |
3 | 101010202120222102210122 |
4 | 1202301233213023331 |
5 | 3214203140413423 |
6 | 120420204544325 |
7 | 10443203602664 |
oct | 1426157471375 |
9 | 333676872718 |
10 | 106061263613 |
11 | 40a86900178 |
12 | 1867b8520a5 |
13 | a0034a8666 |
14 | 51c2059ddb |
15 | 2b5b4248c8 |
hex | 18b1be72fd |
106061263613 has 2 divisors, whose sum is σ = 106061263614. Its totient is φ = 106061263612.
The previous prime is 106061263591. The next prime is 106061263663. The reversal of 106061263613 is 316362160601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71924266969 + 34136996644 = 268187^2 + 184762^2 .
It is an emirp because it is prime and its reverse (316362160601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106061263613 - 26 = 106061263549 is a prime.
It is a super-2 number, since 2×1060612636132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106061263663) 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, 53030631806 + 53030631807.
It is an arithmetic number, because the mean of its divisors is an integer number (53030631807).
Almost surely, 2106061263613 is an apocalyptic number.
It is an amenable number.
106061263613 is a deficient number, since it is larger than the sum of its proper divisors (1).
106061263613 is an equidigital number, since it uses as much as digits as its factorization.
106061263613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 106061263613 in words is "one hundred six billion, sixty-one million, two hundred sixty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •