Base | Representation |
---|---|
bin | 1101011011011… |
… | …00110101111101 |
3 | 21211221212202202 |
4 | 12231230311331 |
5 | 212314042303 |
6 | 15102201245 |
7 | 2535311366 |
oct | 655546575 |
9 | 254855682 |
10 | 112643453 |
11 | 5864776a |
12 | 31883225 |
13 | 1a44c640 |
14 | 10d62b6d |
15 | 9d50c88 |
hex | 6b6cd7d |
112643453 has 16 divisors (see below), whose sum is σ = 127241520. Its totient is φ = 98993664.
The previous prime is 112643437. The next prime is 112643459. The reversal of 112643453 is 354346211.
It can be written as a sum of positive squares in 8 ways, for example, as 4108729 + 108534724 = 2027^2 + 10418^2 .
It is a cyclic number.
It is not a de Polignac number, because 112643453 - 24 = 112643437 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112643459) 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, 25475 + ... + 29567.
It is an arithmetic number, because the mean of its divisors is an integer number (7952595).
Almost surely, 2112643453 is an apocalyptic number.
112643453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
112643453 is a deficient number, since it is larger than the sum of its proper divisors (14598067).
112643453 is a wasteful number, since it uses less digits than its factorization.
112643453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4208.
The product of its digits is 8640, while the sum is 29.
The square root of 112643453 is about 10613.3620026832. The cubic root of 112643453 is about 482.9497938147.
Adding to 112643453 its reverse (354346211), we get a palindrome (466989664).
The spelling of 112643453 in words is "one hundred twelve million, six hundred forty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •