Base | Representation |
---|---|
bin | 1101101110111… |
… | …01000011010111 |
3 | 22000202202222122 |
4 | 12313131003113 |
5 | 213442401330 |
6 | 15233050155 |
7 | 2566120454 |
oct | 667350327 |
9 | 260682878 |
10 | 115200215 |
11 | 5a033699 |
12 | 326b695b |
13 | 1ab36310 |
14 | 1142a82b |
15 | a1a85e5 |
hex | 6ddd0d7 |
115200215 has 32 divisors (see below), whose sum is σ = 156473856. Its totient is φ = 80784000.
The previous prime is 115200193. The next prime is 115200227. The reversal of 115200215 is 512002511.
It is not a de Polignac number, because 115200215 - 224 = 98422999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115200193 and 115200202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 375092 + ... + 375398.
It is an arithmetic number, because the mean of its divisors is an integer number (4889808).
Almost surely, 2115200215 is an apocalyptic number.
115200215 is a deficient number, since it is larger than the sum of its proper divisors (41273641).
115200215 is a wasteful number, since it uses less digits than its factorization.
115200215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 115200215 is about 10733.1363077155. The cubic root of 115200215 is about 486.5764623479.
Adding to 115200215 its reverse (512002511), we get a palindrome (627202726).
The spelling of 115200215 in words is "one hundred fifteen million, two hundred thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •