Base | Representation |
---|---|
bin | 1100000100111… |
… | …00101100011011 |
3 | 21001121211111022 |
4 | 12002130230123 |
5 | 201413230430 |
6 | 14015153055 |
7 | 2340036122 |
oct | 602345433 |
9 | 231554438 |
10 | 101305115 |
11 | 5220303a |
12 | 29b1578b |
13 | 17cac872 |
14 | d650ab9 |
15 | 8d614e5 |
hex | 609cb1b |
101305115 has 4 divisors (see below), whose sum is σ = 121566144. Its totient is φ = 81044088.
The previous prime is 101305111. The next prime is 101305123. The reversal of 101305115 is 511503101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 511503101 = 109 ⋅4692689.
It is a cyclic number.
It is not a de Polignac number, because 101305115 - 22 = 101305111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101305093 and 101305102.
It is not an unprimeable number, because it can be changed into a prime (101305111) 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 3 ways as a sum of consecutive naturals, for example, 10130507 + ... + 10130516.
It is an arithmetic number, because the mean of its divisors is an integer number (30391536).
Almost surely, 2101305115 is an apocalyptic number.
101305115 is a deficient number, since it is larger than the sum of its proper divisors (20261029).
101305115 is an equidigital number, since it uses as much as digits as its factorization.
101305115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20261028.
The product of its (nonzero) digits is 75, while the sum is 17.
The square root of 101305115 is about 10065.0442125209. The cubic root of 101305115 is about 466.1694309820.
Adding to 101305115 its reverse (511503101), we get a palindrome (612808216).
The spelling of 101305115 in words is "one hundred one million, three hundred five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •