Base | Representation |
---|---|
bin | 1100101010011… |
… | …00100100100100 |
3 | 21101212112012010 |
4 | 12111030210210 |
5 | 204143013222 |
6 | 14312354220 |
7 | 2426565516 |
oct | 625144444 |
9 | 241775163 |
10 | 106219812 |
11 | 54a5a576 |
12 | 2b6a5970 |
13 | 1901087a |
14 | 1016dbb6 |
15 | 94d280c |
hex | 654c924 |
106219812 has 24 divisors (see below), whose sum is σ = 253120896. Its totient is φ = 34653088.
The previous prime is 106219801. The next prime is 106219871. The reversal of 106219812 is 218912601.
It is a happy number.
It is a super-2 number, since 2×1062198122 = 22565296922630688, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106219812.
It is an unprimeable number.
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, 93603 + ... + 94730.
It is an arithmetic number, because the mean of its divisors is an integer number (10546704).
Almost surely, 2106219812 is an apocalyptic number.
106219812 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106219812 is an abundant number, since it is smaller than the sum of its proper divisors (146901084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106219812 is a wasteful number, since it uses less digits than its factorization.
106219812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188387 (or 188385 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 30.
The square root of 106219812 is about 10306.2996269272. The cubic root of 106219812 is about 473.5892576640.
The spelling of 106219812 in words is "one hundred six million, two hundred nineteen thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •