Base | Representation |
---|---|
bin | 1101101101011… |
… | …01101111110100 |
3 | 22000101221012020 |
4 | 12312231233310 |
5 | 213420201302 |
6 | 15224553140 |
7 | 2564352531 |
oct | 666555764 |
9 | 260357166 |
10 | 115006452 |
11 | 59a11060 |
12 | 326227b0 |
13 | 1aa99072 |
14 | 113b9d88 |
15 | a16aebc |
hex | 6dadbf4 |
115006452 has 48 divisors (see below), whose sum is σ = 294131712. Its totient is φ = 34685280.
The previous prime is 115006447. The next prime is 115006453. The reversal of 115006452 is 254600511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115006453) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27483 + ... + 31389.
It is an arithmetic number, because the mean of its divisors is an integer number (6127744).
Almost surely, 2115006452 is an apocalyptic number.
115006452 is a gapful number since it is divisible by the number (12) 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 115006452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147065856).
115006452 is an abundant number, since it is smaller than the sum of its proper divisors (179125260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115006452 is a wasteful number, since it uses less digits than its factorization.
115006452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4148 (or 4146 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 115006452 is about 10724.1061165955. The cubic root of 115006452 is about 486.3035073497.
Adding to 115006452 its reverse (254600511), we get a palindrome (369606963).
The spelling of 115006452 in words is "one hundred fifteen million, six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •