Base | Representation |
---|---|
bin | 1010100001110011… |
… | …10111000000110001 |
3 | 112120220211012120002 |
4 | 11100321313000301 |
5 | 43033442441423 |
6 | 2332512355345 |
7 | 260032601030 |
oct | 52071670061 |
9 | 15526735502 |
10 | 5652312113 |
11 | 2440645828 |
12 | 1118b45b55 |
13 | 6c10420a6 |
14 | 3b8984717 |
15 | 231359228 |
hex | 150e77031 |
5652312113 has 4 divisors (see below), whose sum is σ = 6459785280. Its totient is φ = 4844838948.
The previous prime is 5652312053. The next prime is 5652312121. The reversal of 5652312113 is 3112132565.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3112132565 = 5 ⋅622426513.
It is a cyclic number.
It is not a de Polignac number, because 5652312113 - 26 = 5652312049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5652312163) 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, 403736573 + ... + 403736586.
It is an arithmetic number, because the mean of its divisors is an integer number (1614946320).
Almost surely, 25652312113 is an apocalyptic number.
It is an amenable number.
5652312113 is a deficient number, since it is larger than the sum of its proper divisors (807473167).
5652312113 is an equidigital number, since it uses as much as digits as its factorization.
5652312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807473166.
The product of its digits is 5400, while the sum is 29.
The square root of 5652312113 is about 75181.8602656252. The cubic root of 5652312113 is about 1781.3204141357.
Adding to 5652312113 its reverse (3112132565), we get a palindrome (8764444678).
The spelling of 5652312113 in words is "five billion, six hundred fifty-two million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •