Base | Representation |
---|---|
bin | 110001011000101110… |
… | …1100001111100010001 |
3 | 101010202021001121122021 |
4 | 1202301131201330101 |
5 | 3214200432223122 |
6 | 120415515211441 |
7 | 10443115401346 |
oct | 1426135417421 |
9 | 333667047567 |
10 | 106056523537 |
11 | 40a84162958 |
12 | 1867a146b81 |
13 | a002508c93 |
14 | 51c15847cd |
15 | 2b5acda1c7 |
hex | 18b1761f11 |
106056523537 has 4 divisors (see below), whose sum is σ = 106129216240. Its totient is φ = 105983830836.
The previous prime is 106056523483. The next prime is 106056523553. The reversal of 106056523537 is 735325650601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106056523537 - 211 = 106056521489 is a prime.
It is a super-2 number, since 2×1060565235372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106056523493 and 106056523502.
It is not an unprimeable number, because it can be changed into a prime (106056523037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36344163 + ... + 36347080.
It is an arithmetic number, because the mean of its divisors is an integer number (26532304060).
Almost surely, 2106056523537 is an apocalyptic number.
It is an amenable number.
106056523537 is a deficient number, since it is larger than the sum of its proper divisors (72692703).
106056523537 is an equidigital number, since it uses as much as digits as its factorization.
106056523537 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72692702.
The product of its (nonzero) digits is 567000, while the sum is 43.
The spelling of 106056523537 in words is "one hundred six billion, fifty-six million, five hundred twenty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •