Base | Representation |
---|---|
bin | 1011111100111… |
… | …00101101110100 |
3 | 20222122120020110 |
4 | 11332130231310 |
5 | 201131203003 |
6 | 13540503020 |
7 | 2325111243 |
oct | 576345564 |
9 | 228576213 |
10 | 100256628 |
11 | 5165731a |
12 | 296aaa70 |
13 | 17a03564 |
14 | d45a95a |
15 | 8c05a03 |
hex | 5f9cb74 |
100256628 has 24 divisors (see below), whose sum is σ = 234616032. Its totient is φ = 33321184.
The previous prime is 100256627. The next prime is 100256657. The reversal of 100256628 is 826652001.
It is a junction number, because it is equal to n+sod(n) for n = 100256595 and 100256604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100256621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7875 + ... + 16202.
It is an arithmetic number, because the mean of its divisors is an integer number (9775668).
Almost surely, 2100256628 is an apocalyptic number.
It is an amenable number.
100256628 is an abundant number, since it is smaller than the sum of its proper divisors (134359404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100256628 is a wasteful number, since it uses less digits than its factorization.
100256628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24431 (or 24429 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 100256628 is about 10012.8231783049. The cubic root of 100256628 is about 464.5555980806. Note that the first 4 decimals are identical.
It can be divided in two parts, 10025 and 6628, that added together give a triangular number (16653 = T182).
The spelling of 100256628 in words is "one hundred million, two hundred fifty-six thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •