Base | Representation |
---|---|
bin | 1101101110001… |
… | …00101100011001 |
3 | 22000120201010022 |
4 | 12313010230121 |
5 | 213431203231 |
6 | 15231000225 |
7 | 2565223541 |
oct | 667045431 |
9 | 260521108 |
10 | 115100441 |
11 | 59a75735 |
12 | 32669075 |
13 | 1aacca91 |
14 | 11402321 |
15 | a188c7b |
hex | 6dc4b19 |
115100441 has 4 divisors (see below), whose sum is σ = 120104832. Its totient is φ = 110096052.
The previous prime is 115100437. The next prime is 115100459. The reversal of 115100441 is 144001511.
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: 144001511 = 433 ⋅332567.
It is a cyclic number.
It is not a de Polignac number, because 115100441 - 22 = 115100437 is a prime.
It is a super-2 number, since 2×1151004412 = 26496223036788962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115100431) 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, 2502161 + ... + 2502206.
It is an arithmetic number, because the mean of its divisors is an integer number (30026208).
Almost surely, 2115100441 is an apocalyptic number.
It is an amenable number.
115100441 is a deficient number, since it is larger than the sum of its proper divisors (5004391).
115100441 is an equidigital number, since it uses as much as digits as its factorization.
115100441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5004390.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 115100441 is about 10728.4873584304. The cubic root of 115100441 is about 486.4359484252.
Adding to 115100441 its reverse (144001511), we get a palindrome (259101952).
The spelling of 115100441 in words is "one hundred fifteen million, one hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •