Base | Representation |
---|---|
bin | 1011111110110… |
… | …10101001000000 |
3 | 21000010110011200 |
4 | 11333122221000 |
5 | 201212312042 |
6 | 13550141200 |
7 | 2330215602 |
oct | 577325100 |
9 | 230113150 |
10 | 100510272 |
11 | 5180a945 |
12 | 297b1800 |
13 | 17a91b45 |
14 | d4c5172 |
15 | 8c55c4c |
hex | 5fdaa40 |
100510272 has 84 divisors (see below), whose sum is σ = 289809936. Its totient is φ = 33304320.
The previous prime is 100510243. The next prime is 100510279. The reversal of 100510272 is 272015001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (100510279) 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, 121123 + ... + 121949.
Almost surely, 2100510272 is an apocalyptic number.
100510272 is a gapful number since it is divisible by the number (12) 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 100510272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144904968).
100510272 is an abundant number, since it is smaller than the sum of its proper divisors (189299664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100510272 is a wasteful number, since it uses less digits than its factorization.
100510272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056 (or 1043 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 100510272 is about 10025.4811355865. The cubic root of 100510272 is about 464.9470352438.
Adding to 100510272 its reverse (272015001), we get a palindrome (372525273).
The spelling of 100510272 in words is "one hundred million, five hundred ten thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •