Base | Representation |
---|---|
bin | 1101101110001… |
… | …00100110001001 |
3 | 22000120200120111 |
4 | 12313010212021 |
5 | 213431200131 |
6 | 15230554321 |
7 | 2565222430 |
oct | 667044611 |
9 | 260520514 |
10 | 115100041 |
11 | 59a75401 |
12 | 326689a1 |
13 | 1aacc844 |
14 | 11402117 |
15 | a188ab1 |
hex | 6dc4989 |
115100041 has 4 divisors (see below), whose sum is σ = 131542912. Its totient is φ = 98657172.
The previous prime is 115100023. The next prime is 115100053. The reversal of 115100041 is 140001511.
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.
It is a cyclic number.
It is not a de Polignac number, because 115100041 - 25 = 115100009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115099994 and 115100030.
It is not an unprimeable number, because it can be changed into a prime (115100021) 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, 8221425 + ... + 8221438.
It is an arithmetic number, because the mean of its divisors is an integer number (32885728).
Almost surely, 2115100041 is an apocalyptic number.
It is an amenable number.
115100041 is a deficient number, since it is larger than the sum of its proper divisors (16442871).
115100041 is an equidigital number, since it uses as much as digits as its factorization.
115100041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16442870.
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 115100041 is about 10728.4687164572. The cubic root of 115100041 is about 486.4353849330.
Adding to 115100041 its reverse (140001511), we get a palindrome (255101552).
The spelling of 115100041 in words is "one hundred fifteen million, one hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •