Base | Representation |
---|---|
bin | 1011111110101… |
… | …00111101000101 |
3 | 21000002021020001 |
4 | 11333110331011 |
5 | 201211040411 |
6 | 13545441301 |
7 | 2330060650 |
oct | 577247505 |
9 | 230067201 |
10 | 100486981 |
11 | 517a43a1 |
12 | 297a0231 |
13 | 17a8436a |
14 | d4ba897 |
15 | 8c4ddc1 |
hex | 5fd4f45 |
100486981 has 8 divisors (see below), whose sum is σ = 114903360. Its totient is φ = 86085888.
The previous prime is 100486979. The next prime is 100487011. The reversal of 100486981 is 189684001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100486981 - 21 = 100486979 is a prime.
It is a super-2 number, since 2×1004869812 = 20195266700988722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100486981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100486921) 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, 21285 + ... + 25573.
It is an arithmetic number, because the mean of its divisors is an integer number (14362920).
Almost surely, 2100486981 is an apocalyptic number.
It is an amenable number.
100486981 is a deficient number, since it is larger than the sum of its proper divisors (14416379).
100486981 is an equidigital number, since it uses as much as digits as its factorization.
100486981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7643.
The product of its (nonzero) digits is 13824, while the sum is 37.
The square root of 100486981 is about 10024.3194781491. The cubic root of 100486981 is about 464.9111187889.
The spelling of 100486981 in words is "one hundred million, four hundred eighty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •