Base | Representation |
---|---|
bin | 1100000110011… |
… | …01100100101000 |
3 | 21002000000010022 |
4 | 12003031210220 |
5 | 201441132240 |
6 | 14023340012 |
7 | 2341531610 |
oct | 603154450 |
9 | 232000108 |
10 | 101505320 |
11 | 5232a4a4 |
12 | 29bb1608 |
13 | 1804ca27 |
14 | d6a3a40 |
15 | 8da09b5 |
hex | 60cd928 |
101505320 has 64 divisors (see below), whose sum is σ = 262327680. Its totient is φ = 34626816.
The previous prime is 101505293. The next prime is 101505329. The reversal of 101505320 is 23505101.
It is not an unprimeable number, because it can be changed into a prime (101505329) 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 15 ways as a sum of consecutive naturals, for example, 62762 + ... + 64358.
It is an arithmetic number, because the mean of its divisors is an integer number (4098870).
Almost surely, 2101505320 is an apocalyptic number.
101505320 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 101505320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131163840).
101505320 is an abundant number, since it is smaller than the sum of its proper divisors (160822360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101505320 is a wasteful number, since it uses less digits than its factorization.
101505320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1842 (or 1838 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 101505320 is about 10074.9848635122. The cubic root of 101505320 is about 466.4763191956.
The spelling of 101505320 in words is "one hundred one million, five hundred five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •