Base | Representation |
---|---|
bin | 110001011000101011… |
… | …1111110010000011010 |
3 | 101010202011022121011111 |
4 | 1202301113332100122 |
5 | 3214200044113100 |
6 | 120415424050534 |
7 | 10443100123021 |
oct | 1426127762032 |
9 | 333664277144 |
10 | 106055066650 |
11 | 40a83358315 |
12 | 18679763a4a |
13 | a002118b10 |
14 | 51c12c58b8 |
15 | 2b5aaed6ba |
hex | 18b15fe41a |
106055066650 has 96 divisors (see below), whose sum is σ = 216208255536. Its totient is φ = 38465280000.
The previous prime is 106055066641. The next prime is 106055066651. The reversal of 106055066650 is 56660550601.
It can be written as a sum of positive squares in 24 ways, for example, as 68880527401 + 37174539249 = 262451^2 + 192807^2 .
It is a super-2 number, since 2×1060550666502 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106055066651) 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 47 ways as a sum of consecutive naturals, for example, 42067390 + ... + 42069910.
Almost surely, 2106055066650 is an apocalyptic number.
106055066650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106055066650 is an abundant number, since it is smaller than the sum of its proper divisors (110153188886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106055066650 is a wasteful number, since it uses less digits than its factorization.
106055066650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3668 (or 3663 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 106055066650 in words is "one hundred six billion, fifty-five million, sixty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •