Base | Representation |
---|---|
bin | 1100001000001… |
… | …00000100010010 |
3 | 21002102100022100 |
4 | 12010010010102 |
5 | 202020303110 |
6 | 14032221230 |
7 | 2343451431 |
oct | 604040422 |
9 | 232370270 |
10 | 101728530 |
11 | 52472172 |
12 | 2a09a816 |
13 | 180ca4c7 |
14 | d721118 |
15 | 8de6bc0 |
hex | 6104112 |
101728530 has 24 divisors (see below), whose sum is σ = 264494412. Its totient is φ = 27127584.
The previous prime is 101728519. The next prime is 101728531. The reversal of 101728530 is 35827101.
101728530 is a `hidden beast` number, since 101 + 7 + 28 + 530 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 96294969 + 5433561 = 9813^2 + 2331^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101728494 and 101728503.
It is not an unprimeable number, because it can be changed into a prime (101728531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 565069 + ... + 565248.
Almost surely, 2101728530 is an apocalyptic number.
101728530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101728530 is an abundant number, since it is smaller than the sum of its proper divisors (162765882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101728530 is a wasteful number, since it uses less digits than its factorization.
101728530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130330 (or 1130327 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 101728530 is about 10086.0562163811. The cubic root of 101728530 is about 466.8179957068.
The spelling of 101728530 in words is "one hundred one million, seven hundred twenty-eight thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •