Base | Representation |
---|---|
bin | 1101011111110… |
… | …00100010100001 |
3 | 21220000221200012 |
4 | 12233320202201 |
5 | 212440400044 |
6 | 15122334305 |
7 | 2543213531 |
oct | 657704241 |
9 | 256027605 |
10 | 113215649 |
11 | 589a8658 |
12 | 31aba395 |
13 | 1a5bcc11 |
14 | 110714c1 |
15 | 9e1559e |
hex | 6bf88a1 |
113215649 has 4 divisors (see below), whose sum is σ = 113238660. Its totient is φ = 113192640.
The previous prime is 113215633. The next prime is 113215651. The reversal of 113215649 is 946512311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 946512311 = 3079 ⋅307409.
It can be written as a sum of positive squares in 2 ways, for example, as 91546624 + 21669025 = 9568^2 + 4655^2 .
It is a cyclic number.
It is not a de Polignac number, because 113215649 - 24 = 113215633 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (113215679) 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, 812 + ... + 15069.
It is an arithmetic number, because the mean of its divisors is an integer number (28309665).
Almost surely, 2113215649 is an apocalyptic number.
It is an amenable number.
113215649 is a deficient number, since it is larger than the sum of its proper divisors (23011).
113215649 is an equidigital number, since it uses as much as digits as its factorization.
113215649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23010.
The product of its digits is 6480, while the sum is 32.
The square root of 113215649 is about 10640.2842537218. The cubic root of 113215649 is about 483.7661612604.
The spelling of 113215649 in words is "one hundred thirteen million, two hundred fifteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •