Base | Representation |
---|---|
bin | 110001011000011011… |
… | …0110001001110100001 |
3 | 101010201112221101100122 |
4 | 1202300312301032201 |
5 | 3214140332100104 |
6 | 120414513330025 |
7 | 10442633131412 |
oct | 1426066611641 |
9 | 333645841318 |
10 | 106046362529 |
11 | 40a79452828 |
12 | 18676866915 |
13 | a00038c053 |
14 | 51c009b809 |
15 | 2b59e7e6be |
hex | 18b0db13a1 |
106046362529 has 2 divisors, whose sum is σ = 106046362530. Its totient is φ = 106046362528.
The previous prime is 106046362489. The next prime is 106046362601. The reversal of 106046362529 is 925263640601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99318261904 + 6728100625 = 315148^2 + 82025^2 .
It is a cyclic number.
It is not a de Polignac number, because 106046362529 - 220 = 106045313953 is a prime.
It is a super-2 number, since 2×1060463625292 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106046362529.
It is not a weakly prime, because it can be changed into another prime (106046362129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53023181264 + 53023181265.
It is an arithmetic number, because the mean of its divisors is an integer number (53023181265).
Almost surely, 2106046362529 is an apocalyptic number.
It is an amenable number.
106046362529 is a deficient number, since it is larger than the sum of its proper divisors (1).
106046362529 is an equidigital number, since it uses as much as digits as its factorization.
106046362529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 44.
The spelling of 106046362529 in words is "one hundred six billion, forty-six million, three hundred sixty-two thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •