Base | Representation |
---|---|
bin | 1011111100111… |
… | …00001000001110 |
3 | 20222122102221100 |
4 | 11332130020032 |
5 | 201131113342 |
6 | 13540443530 |
7 | 2325101235 |
oct | 576341016 |
9 | 228572840 |
10 | 100254222 |
11 | 51655532 |
12 | 296a95a6 |
13 | 17a02433 |
14 | d459b1c |
15 | 8c04e4c |
hex | 5f9c20e |
100254222 has 48 divisors (see below), whose sum is σ = 229516560. Its totient is φ = 31539456.
The previous prime is 100254197. The next prime is 100254233. The reversal of 100254222 is 222452001.
100254222 is a `hidden beast` number, since 100 + 2 + 542 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 100254195 and 100254204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 147748 + ... + 148424.
It is an arithmetic number, because the mean of its divisors is an integer number (4781595).
Almost surely, 2100254222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100254222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114758280).
100254222 is an abundant number, since it is smaller than the sum of its proper divisors (129262338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100254222 is a wasteful number, since it uses less digits than its factorization.
100254222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1137 (or 1134 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 100254222 is about 10012.7030316493. The cubic root of 100254222 is about 464.5518818518.
The spelling of 100254222 in words is "one hundred million, two hundred fifty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •