Base | Representation |
---|---|
bin | 1101101101110… |
… | …11001011001101 |
3 | 22000111201122022 |
4 | 12312323023031 |
5 | 213423431303 |
6 | 15230055525 |
7 | 2565002063 |
oct | 666731315 |
9 | 260451568 |
10 | 115061453 |
11 | 59a49411 |
12 | 3264a5a5 |
13 | 1aab8100 |
14 | 113d2033 |
15 | a17c438 |
hex | 6dbb2cd |
115061453 has 12 divisors (see below), whose sum is σ = 127967508. Its totient is φ = 103334400.
The previous prime is 115061449. The next prime is 115061501. The reversal of 115061453 is 354160511.
It can be written as a sum of positive squares in 6 ways, for example, as 4012009 + 111049444 = 2003^2 + 10538^2 .
It is not a de Polignac number, because 115061453 - 22 = 115061449 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115061413) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2948 + ... + 15453.
It is an arithmetic number, because the mean of its divisors is an integer number (10663959).
Almost surely, 2115061453 is an apocalyptic number.
115061453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115061453 is a deficient number, since it is larger than the sum of its proper divisors (12906055).
115061453 is a wasteful number, since it uses less digits than its factorization.
115061453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18464 (or 18451 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 115061453 is about 10726.6701729847. The cubic root of 115061453 is about 486.3810187008.
The spelling of 115061453 in words is "one hundred fifteen million, sixty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •