Base | Representation |
---|---|
bin | 1101011110100… |
… | …00001001101011 |
3 | 21212201112202011 |
4 | 12233100021223 |
5 | 212420101334 |
6 | 15115020351 |
7 | 2541624322 |
oct | 657201153 |
9 | 255645664 |
10 | 113050219 |
11 | 588a5337 |
12 | 31a3a6b7 |
13 | 1a562829 |
14 | 1102b0b9 |
15 | 9dd1564 |
hex | 6bd026b |
113050219 has 4 divisors (see below), whose sum is σ = 115183296. Its totient is φ = 110917144.
The previous prime is 113050183. The next prime is 113050237. The reversal of 113050219 is 912050311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113050219 - 29 = 113049707 is a prime.
It is a super-2 number, since 2×1130502192 = 25560704031895922, which contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113050219.
It is not an unprimeable number, because it can be changed into a prime (113054219) 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, 1066459 + ... + 1066564.
It is an arithmetic number, because the mean of its divisors is an integer number (28795824).
Almost surely, 2113050219 is an apocalyptic number.
113050219 is a deficient number, since it is larger than the sum of its proper divisors (2133077).
113050219 is an equidigital number, since it uses as much as digits as its factorization.
113050219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2133076.
The product of its (nonzero) digits is 270, while the sum is 22.
The square root of 113050219 is about 10632.5076534184. The cubic root of 113050219 is about 483.5304210367.
The spelling of 113050219 in words is "one hundred thirteen million, fifty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •