Base | Representation |
---|---|
bin | 110001011010110100… |
… | …0111011101101100001 |
3 | 101010221010221222000111 |
4 | 1202311220323231201 |
5 | 3214321403342122 |
6 | 120430501451321 |
7 | 10444626253606 |
oct | 1426550735541 |
9 | 333833858014 |
10 | 106126621537 |
11 | 4100a790592 |
12 | 18699710b41 |
13 | a013bb02a1 |
14 | 51ca9d06ad |
15 | 2b62034d77 |
hex | 18b5a3bb61 |
106126621537 has 2 divisors, whose sum is σ = 106126621538. Its totient is φ = 106126621536.
The previous prime is 106126621507. The next prime is 106126621543. The reversal of 106126621537 is 735126621601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55915223296 + 50211398241 = 236464^2 + 224079^2 .
It is an emirp because it is prime and its reverse (735126621601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106126621537 is a prime.
It is a super-2 number, since 2×1061266215372 (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 106126621537.
It is not a weakly prime, because it can be changed into another prime (106126621507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53063310768 + 53063310769.
It is an arithmetic number, because the mean of its divisors is an integer number (53063310769).
Almost surely, 2106126621537 is an apocalyptic number.
It is an amenable number.
106126621537 is a deficient number, since it is larger than the sum of its proper divisors (1).
106126621537 is an equidigital number, since it uses as much as digits as its factorization.
106126621537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 106126621537 in words is "one hundred six billion, one hundred twenty-six million, six hundred twenty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •