Base | Representation |
---|---|
bin | 1100000010000… |
… | …00101111101010 |
3 | 21000220200212020 |
4 | 12001000233222 |
5 | 201314202430 |
6 | 14003125310 |
7 | 2333610105 |
oct | 601005752 |
9 | 230820766 |
10 | 100928490 |
11 | 51a76083 |
12 | 29973836 |
13 | 17baa300 |
14 | d59373c |
15 | 8cd9b10 |
hex | 6040bea |
100928490 has 96 divisors (see below), whose sum is σ = 277960896. Its totient is φ = 23362560.
The previous prime is 100928479. The next prime is 100928491. The reversal of 100928490 is 94829001.
It is not an unprimeable number, because it can be changed into a prime (100928491) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 85605 + ... + 86775.
It is an arithmetic number, because the mean of its divisors is an integer number (2895426).
Almost surely, 2100928490 is an apocalyptic number.
100928490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 100928490, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138980448).
100928490 is an abundant number, since it is smaller than the sum of its proper divisors (177032406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100928490 is a wasteful number, since it uses less digits than its factorization.
100928490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224 (or 1211 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 33.
The square root of 100928490 is about 10046.3172356839. The cubic root of 100928490 is about 465.5910163327.
The spelling of 100928490 in words is "one hundred million, nine hundred twenty-eight thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •