Base | Representation |
---|---|
bin | 1100000011010… |
… | …00111100001010 |
3 | 21001020001201000 |
4 | 12001220330022 |
5 | 201334440010 |
6 | 14010435430 |
7 | 2335164105 |
oct | 601507412 |
9 | 231201630 |
10 | 101093130 |
11 | 52078846 |
12 | 29a32b76 |
13 | 17c37228 |
14 | d5d773c |
15 | 8d1d7c0 |
hex | 6068f0a |
101093130 has 64 divisors (see below), whose sum is σ = 278899200. Its totient is φ = 26026560.
The previous prime is 101093123. The next prime is 101093149. The reversal of 101093130 is 31390101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1375 + ... + 14285.
It is an arithmetic number, because the mean of its divisors is an integer number (4357800).
Almost surely, 2101093130 is an apocalyptic number.
101093130 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 101093130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139449600).
101093130 is an abundant number, since it is smaller than the sum of its proper divisors (177806070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101093130 is a wasteful number, since it uses less digits than its factorization.
101093130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12956 (or 12950 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
The square root of 101093130 is about 10054.5079442009. The cubic root of 101093130 is about 465.8440445294.
The spelling of 101093130 in words is "one hundred one million, ninety-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •