Base | Representation |
---|---|
bin | 1100110000100… |
… | …11001101101101 |
3 | 21110101212021222 |
4 | 12120103031231 |
5 | 204400032303 |
6 | 14342033125 |
7 | 2436524612 |
oct | 630231555 |
9 | 243355258 |
10 | 107033453 |
11 | 554658aa |
12 | 2ba187a5 |
13 | 19237007 |
14 | 10302509 |
15 | 95e3938 |
hex | 661336d |
107033453 has 4 divisors (see below), whose sum is σ = 107074620. Its totient is φ = 106992288.
The previous prime is 107033431. The next prime is 107033497. The reversal of 107033453 is 354330701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 354330701 = 197 ⋅1798633.
It can be written as a sum of positive squares in 2 ways, for example, as 22448644 + 84584809 = 4738^2 + 9197^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107033453 is a prime.
It is a super-2 number, since 2×1070334532 = 22912320122206418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107033413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16400 + ... + 21977.
It is an arithmetic number, because the mean of its divisors is an integer number (26768655).
Almost surely, 2107033453 is an apocalyptic number.
It is an amenable number.
107033453 is a deficient number, since it is larger than the sum of its proper divisors (41167).
107033453 is an equidigital number, since it uses as much as digits as its factorization.
107033453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41166.
The product of its (nonzero) digits is 3780, while the sum is 26.
The square root of 107033453 is about 10345.6973182092. The cubic root of 107033453 is about 474.7954103231.
The spelling of 107033453 in words is "one hundred seven million, thirty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •