Base | Representation |
---|---|
bin | 110001011010000110… |
… | …0111101111111100000 |
3 | 101010212110121011012010 |
4 | 1202310030331333200 |
5 | 3214244220414012 |
6 | 120424241032520 |
7 | 10444214325303 |
oct | 1426414757740 |
9 | 333773534163 |
10 | 106102513632 |
11 | 40aa81149a5 |
12 | 18691625740 |
13 | a00bbbc15b |
14 | 51c7716b3a |
15 | 2b5ed71c3c |
hex | 18b433dfe0 |
106102513632 has 48 divisors (see below), whose sum is σ = 278711943552. Its totient is φ = 35343016320.
The previous prime is 106102513619. The next prime is 106102513697. The reversal of 106102513632 is 236315201601.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1061025136322 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106102513632.
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, 242994 + ... + 520817.
It is an arithmetic number, because the mean of its divisors is an integer number (5806498824).
Almost surely, 2106102513632 is an apocalyptic number.
106102513632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106102513632 is an abundant number, since it is smaller than the sum of its proper divisors (172609429920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106102513632 is a wasteful number, since it uses less digits than its factorization.
106102513632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 765271 (or 765263 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 106102513632 in words is "one hundred six billion, one hundred two million, five hundred thirteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •