Base | Representation |
---|---|
bin | 110001011000111001… |
… | …0100010111010011101 |
3 | 101010202122102111120110 |
4 | 1202301302202322131 |
5 | 3214203340020131 |
6 | 120420233240233 |
7 | 10443213254523 |
oct | 1426162427235 |
9 | 333678374513 |
10 | 106062032541 |
11 | 40a87285953 |
12 | 1867bb63079 |
13 | a0036b764a |
14 | 51c21ba313 |
15 | 2b5b527646 |
hex | 18b1ca2e9d |
106062032541 has 8 divisors (see below), whose sum is σ = 148858993120. Its totient is φ = 66986546832.
The previous prime is 106062032539. The next prime is 106062032569. The reversal of 106062032541 is 145230260601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106062032541 - 21 = 106062032539 is a prime.
It is a super-2 number, since 2×1060620325412 (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 = 106062032499 and 106062032508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106062032501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 930368650 + ... + 930368763.
It is an arithmetic number, because the mean of its divisors is an integer number (18607374140).
Almost surely, 2106062032541 is an apocalyptic number.
It is an amenable number.
106062032541 is a deficient number, since it is larger than the sum of its proper divisors (42796960579).
106062032541 is a wasteful number, since it uses less digits than its factorization.
106062032541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1860737435.
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 106062032541 in words is "one hundred six billion, sixty-two million, thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •