Base | Representation |
---|---|
bin | 1101101110001… |
… | …01110001010011 |
3 | 22000120221011122 |
4 | 12313011301103 |
5 | 213431323401 |
6 | 15231032455 |
7 | 2565242441 |
oct | 667056123 |
9 | 260527148 |
10 | 115104851 |
11 | 59a78a84 |
12 | 3266b72b |
13 | 1ab01aa4 |
14 | 11403b91 |
15 | a18a21b |
hex | 6dc5c53 |
115104851 has 8 divisors (see below), whose sum is σ = 118829040. Its totient is φ = 111428352.
The previous prime is 115104839. The next prime is 115104863. The reversal of 115104851 is 158401511.
It is an interprime number because it is at equal distance from previous prime (115104839) and next prime (115104863).
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-115104851 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 115104851.
It is not an unprimeable number, because it can be changed into a prime (115104881) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6986 + ... + 16703.
It is an arithmetic number, because the mean of its divisors is an integer number (14853630).
Almost surely, 2115104851 is an apocalyptic number.
115104851 is a deficient number, since it is larger than the sum of its proper divisors (3724189).
115104851 is a wasteful number, since it uses less digits than its factorization.
115104851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23845.
The product of its (nonzero) digits is 800, while the sum is 26.
The square root of 115104851 is about 10728.6928840376. The cubic root of 115104851 is about 486.4421608403.
It can be divided in two parts, 11510 and 4851, that added together give a palindrome (16361).
The spelling of 115104851 in words is "one hundred fifteen million, one hundred four thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •