Base | Representation |
---|---|
bin | 110001101101100111… |
… | …1000000111001100000 |
3 | 101012120002210212020112 |
4 | 1203123033000321200 |
5 | 3222114341024443 |
6 | 121013232430452 |
7 | 10466355412106 |
oct | 1433317007140 |
9 | 335502725215 |
10 | 106757361248 |
11 | 4130382467a |
12 | 188349a8428 |
13 | a0b477c755 |
14 | 524a699c76 |
15 | 2b9c5c5b18 |
hex | 18db3c0e60 |
106757361248 has 24 divisors (see below), whose sum is σ = 211234741200. Its totient is φ = 53110442880.
The previous prime is 106757361247. The next prime is 106757361281. The reversal of 106757361248 is 842163757601.
106757361248 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1067573612482 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106757361196 and 106757361205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106757361247) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 8375963 + ... + 8388698.
It is an arithmetic number, because the mean of its divisors is an integer number (8801447550).
Almost surely, 2106757361248 is an apocalyptic number.
It is an amenable number.
106757361248 is a deficient number, since it is larger than the sum of its proper divisors (104477379952).
106757361248 is a wasteful number, since it uses less digits than its factorization.
106757361248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16764870 (or 16764862 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 106757361248 in words is "one hundred six billion, seven hundred fifty-seven million, three hundred sixty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •