Base | Representation |
---|---|
bin | 110001001001001010… |
… | …1110100111100101001 |
3 | 101002101212121112020202 |
4 | 1202102111310330221 |
5 | 3212113302114122 |
6 | 120252024401545 |
7 | 10424145455123 |
oct | 1422225647451 |
9 | 332355545222 |
10 | 105534410537 |
11 | 40836472706 |
12 | 185533162b5 |
13 | 9c4b2b0a8a |
14 | 51720b4213 |
15 | 2b2a054e92 |
hex | 1892574f29 |
105534410537 has 2 divisors, whose sum is σ = 105534410538. Its totient is φ = 105534410536.
The previous prime is 105534410507. The next prime is 105534410563. The reversal of 105534410537 is 735014435501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84831805081 + 20702605456 = 291259^2 + 143884^2 .
It is an emirp because it is prime and its reverse (735014435501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105534410537 - 216 = 105534345001 is a prime.
It is a super-2 number, since 2×1055344105372 (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 105534410537.
It is not a weakly prime, because it can be changed into another prime (105534410507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52767205268 + 52767205269.
It is an arithmetic number, because the mean of its divisors is an integer number (52767205269).
Almost surely, 2105534410537 is an apocalyptic number.
It is an amenable number.
105534410537 is a deficient number, since it is larger than the sum of its proper divisors (1).
105534410537 is an equidigital number, since it uses as much as digits as its factorization.
105534410537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 126000, while the sum is 38.
The spelling of 105534410537 in words is "one hundred five billion, five hundred thirty-four million, four hundred ten thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •