Base | Representation |
---|---|
bin | 1100000100110… |
… | …11100111000101 |
3 | 21001121121101221 |
4 | 12002123213011 |
5 | 201413110202 |
6 | 14015120341 |
7 | 2340020152 |
oct | 602334705 |
9 | 231547357 |
10 | 101300677 |
11 | 521aa775 |
12 | 29b130b1 |
13 | 17caa83a |
14 | d64d229 |
15 | 8d60037 |
hex | 609b9c5 |
101300677 has 8 divisors (see below), whose sum is σ = 103064472. Its totient is φ = 99552000.
The previous prime is 101300663. The next prime is 101300681. The reversal of 101300677 is 776003101.
It can be written as a sum of positive squares in 4 ways, for example, as 11600836 + 89699841 = 3406^2 + 9471^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101300677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101300377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10177 + ... + 17497.
It is an arithmetic number, because the mean of its divisors is an integer number (12883059).
Almost surely, 2101300677 is an apocalyptic number.
It is an amenable number.
101300677 is a deficient number, since it is larger than the sum of its proper divisors (1763795).
101300677 is a wasteful number, since it uses less digits than its factorization.
101300677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7559.
The product of its (nonzero) digits is 882, while the sum is 25.
The square root of 101300677 is about 10064.8237441100. The cubic root of 101300677 is about 466.1626235266.
Adding to 101300677 its reverse (776003101), we get a palindrome (877303778).
The spelling of 101300677 in words is "one hundred one million, three hundred thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •