Base | Representation |
---|---|
bin | 1100101010011… |
… | …00011000011000 |
3 | 21101212111010020 |
4 | 12111030120120 |
5 | 204143002112 |
6 | 14312350440 |
7 | 2426563323 |
oct | 625143030 |
9 | 241774106 |
10 | 106219032 |
11 | 54a59a27 |
12 | 2b6a5420 |
13 | 190103ca |
14 | 1016d7ba |
15 | 94d248c |
hex | 654c618 |
106219032 has 32 divisors (see below), whose sum is σ = 266166000. Its totient is φ = 35323904.
The previous prime is 106219027. The next prime is 106219033. The reversal of 106219032 is 230912601.
It is a super-2 number, since 2×1062190322 = 22564965518034048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 106218993 and 106219011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106219033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5848 + ... + 15704.
Almost surely, 2106219032 is an apocalyptic number.
106219032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106219032 is an abundant number, since it is smaller than the sum of its proper divisors (159946968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106219032 is a wasteful number, since it uses less digits than its factorization.
106219032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10315 (or 10311 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 106219032 is about 10306.2617859241. The cubic root of 106219032 is about 473.5880984310.
The spelling of 106219032 in words is "one hundred six million, two hundred nineteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •