Base | Representation |
---|---|
bin | 1101101110010… |
… | …00010011000001 |
3 | 22000121110100222 |
4 | 12313020103001 |
5 | 213432141301 |
6 | 15231152425 |
7 | 2565314555 |
oct | 667102301 |
9 | 260543328 |
10 | 115115201 |
11 | 59a85833 |
12 | 32675715 |
13 | 1ab06706 |
14 | 11407865 |
15 | a18d31b |
hex | 6dc84c1 |
115115201 has 4 divisors (see below), whose sum is σ = 116191152. Its totient is φ = 114039252.
The previous prime is 115115197. The next prime is 115115261. The reversal of 115115201 is 102511511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 102511511 = 197 ⋅520363.
It is a cyclic number.
It is not a de Polignac number, because 115115201 - 22 = 115115197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115115201.
It is not an unprimeable number, because it can be changed into a prime (115115261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 537815 + ... + 538028.
It is an arithmetic number, because the mean of its divisors is an integer number (29047788).
Almost surely, 2115115201 is an apocalyptic number.
It is an amenable number.
115115201 is a deficient number, since it is larger than the sum of its proper divisors (1075951).
115115201 is a wasteful number, since it uses less digits than its factorization.
115115201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1075950.
The product of its (nonzero) digits is 50, while the sum is 17.
The square root of 115115201 is about 10729.1752245921. The cubic root of 115115201 is about 486.4567403749.
Adding to 115115201 its reverse (102511511), we get a palindrome (217626712).
The spelling of 115115201 in words is "one hundred fifteen million, one hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •