Base | Representation |
---|---|
bin | 1011111011111… |
… | …00110110010000 |
3 | 20222101221011221 |
4 | 11331330312100 |
5 | 201113013341 |
6 | 13534014424 |
7 | 2324025550 |
oct | 575746620 |
9 | 228357157 |
10 | 100126096 |
11 | 51578244 |
12 | 29647414 |
13 | 17989015 |
14 | d425160 |
15 | 8bcbed1 |
hex | 5f7cd90 |
100126096 has 60 divisors (see below), whose sum is σ = 229832512. Its totient is φ = 41392512.
The previous prime is 100126093. The next prime is 100126109. The reversal of 100126096 is 690621001.
It is a self number, because there is not a number n which added to its sum of digits gives 100126096.
It is not an unprimeable number, because it can be changed into a prime (100126093) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93661 + ... + 94723.
Almost surely, 2100126096 is an apocalyptic number.
100126096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100126096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114916256).
100126096 is an abundant number, since it is smaller than the sum of its proper divisors (129706416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100126096 is a wasteful number, since it uses less digits than its factorization.
100126096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1136 (or 1101 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 100126096 is about 10006.3028137270. The cubic root of 100126096 is about 464.3538966781.
Adding to 100126096 its reverse (690621001), we get a palindrome (790747097).
The spelling of 100126096 in words is "one hundred million, one hundred twenty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •