Base | Representation |
---|---|
bin | 1101101110010… |
… | …01110000110000 |
3 | 22000121202121011 |
4 | 12313021300300 |
5 | 213432334300 |
6 | 15231240304 |
7 | 2565341215 |
oct | 667116060 |
9 | 260552534 |
10 | 115121200 |
11 | 59a8a297 |
12 | 32679094 |
13 | 1ab0936c |
14 | 11409b0c |
15 | a18eeba |
hex | 6dc9c30 |
115121200 has 60 divisors (see below), whose sum is σ = 277844320. Its totient is φ = 45838080.
The previous prime is 115121183. The next prime is 115121207. The reversal of 115121200 is 2121511.
It is not an unprimeable number, because it can be changed into a prime (115121207) 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 11 ways as a sum of consecutive naturals, for example, 110281 + ... + 111319.
Almost surely, 2115121200 is an apocalyptic number.
115121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115121200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138922160).
115121200 is an abundant number, since it is smaller than the sum of its proper divisors (162723120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115121200 is a wasteful number, since it uses less digits than its factorization.
115121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334 (or 1323 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 115121200 is about 10729.4547857755. The cubic root of 115121200 is about 486.4651904703.
Adding to 115121200 its reverse (2121511), we get a palindrome (117242711).
The spelling of 115121200 in words is "one hundred fifteen million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •