Base | Representation |
---|---|
bin | 1100001001101… |
… | …01010000010000 |
3 | 21002210120200012 |
4 | 12010311100100 |
5 | 202043230000 |
6 | 14040414052 |
7 | 2345251004 |
oct | 604652020 |
9 | 232716605 |
10 | 101930000 |
11 | 5259a577 |
12 | 2a177328 |
13 | 1816b113 |
14 | d774704 |
15 | 8e36735 |
hex | 6135410 |
101930000 has 50 divisors (see below), whose sum is σ = 246806934. Its totient is φ = 40768000.
The previous prime is 101929999. The next prime is 101930029. The reversal of 101930000 is 39101.
It can be written as a sum of positive squares in 5 ways, for example, as 29203216 + 72726784 = 5404^2 + 8528^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4904 + ... + 15096.
Almost surely, 2101930000 is an apocalyptic number.
101930000 is a gapful number since it is divisible by the number (10) 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 101930000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123403467).
101930000 is an abundant number, since it is smaller than the sum of its proper divisors (144876934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101930000 is an equidigital number, since it uses as much as digits as its factorization.
101930000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10221 (or 10200 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
The square root of 101930000 is about 10096.0388271837. The cubic root of 101930000 is about 467.1259650388.
Adding to 101930000 its reverse (39101), we get a palindrome (101969101).
The spelling of 101930000 in words is "one hundred one million, nine hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •