Base | Representation |
---|---|
bin | 110001011000110010… |
… | …1101001010110011000 |
3 | 101010202102001201000101 |
4 | 1202301211221112120 |
5 | 3214202003313112 |
6 | 120420032545144 |
7 | 10443142442065 |
oct | 1426145512630 |
9 | 333672051011 |
10 | 106058651032 |
11 | 40a85386314 |
12 | 1867a9b21b4 |
13 | a002aa2459 |
14 | 51c1979c6c |
15 | 2b5b0aa757 |
hex | 18b1969598 |
106058651032 has 32 divisors (see below), whose sum is σ = 200052374400. Its totient is φ = 52712218624.
The previous prime is 106058650979. The next prime is 106058651089. The reversal of 106058651032 is 230156850601.
It is a super-2 number, since 2×1060586510322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106058650982 and 106058651000.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 930978 + ... + 1038670.
It is an arithmetic number, because the mean of its divisors is an integer number (6251636700).
Almost surely, 2106058651032 is an apocalyptic number.
It is an amenable number.
106058651032 is a deficient number, since it is larger than the sum of its proper divisors (93993723368).
106058651032 is a wasteful number, since it uses less digits than its factorization.
106058651032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108435 (or 108431 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 106058651032 in words is "one hundred six billion, fifty-eight million, six hundred fifty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •