Base | Representation |
---|---|
bin | 1100000100111… |
… | …10010010000000 |
3 | 21001122011102002 |
4 | 12002132102000 |
5 | 201413432431 |
6 | 14015243132 |
7 | 2340064100 |
oct | 602362200 |
9 | 231564362 |
10 | 101311616 |
11 | 52207a0a |
12 | 29b194a8 |
13 | 17cb2803 |
14 | d653200 |
15 | 8d633cb |
hex | 609e480 |
101311616 has 96 divisors (see below), whose sum is σ = 243315900. Its totient is φ = 41846784.
The previous prime is 101311607. The next prime is 101311631. The reversal of 101311616 is 616113101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 96040000 + 5271616 = 9800^2 + 2296^2 .
It is a nialpdrome in base 14.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 181610 + ... + 182166.
Almost surely, 2101311616 is an apocalyptic number.
101311616 is a gapful number since it is divisible by the number (16) 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 101311616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121657950).
101311616 is an abundant number, since it is smaller than the sum of its proper divisors (142004284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101311616 is an equidigital number, since it uses as much as digits as its factorization.
101311616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614 (or 595 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
The square root of 101311616 is about 10065.3671567410. The cubic root of 101311616 is about 466.1794025174.
Adding to 101311616 its reverse (616113101), we get a palindrome (717424717).
The spelling of 101311616 in words is "one hundred one million, three hundred eleven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •