Base | Representation |
---|---|
bin | 110001110011011110… |
… | …0101110110000101110 |
3 | 101020001210121210210211 |
4 | 1203212330232300232 |
5 | 3223020144114313 |
6 | 121044533053034 |
7 | 10504263051511 |
oct | 1434674566056 |
9 | 336053553724 |
10 | 106953894958 |
11 | 413a475a329 |
12 | 1888a78717a |
13 | a1163c20a1 |
14 | 5268818d78 |
15 | 2bae997e3d |
hex | 18e6f2ec2e |
106953894958 has 16 divisors (see below), whose sum is σ = 167428550016. Its totient is φ = 51145002040.
The previous prime is 106953894941. The next prime is 106953895021. The reversal of 106953894958 is 859498359601.
It is a super-2 number, since 2×1069538949582 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106953894893 and 106953894902.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199473 + ... + 503683.
It is an arithmetic number, because the mean of its divisors is an integer number (10464284376).
Almost surely, 2106953894958 is an apocalyptic number.
106953894958 is a deficient number, since it is larger than the sum of its proper divisors (60474655058).
106953894958 is a wasteful number, since it uses less digits than its factorization.
106953894958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311879.
The product of its (nonzero) digits is 83980800, while the sum is 67.
The spelling of 106953894958 in words is "one hundred six billion, nine hundred fifty-three million, eight hundred ninety-four thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •