Base | Representation |
---|---|
bin | 1001100010110001… |
… | …01001011101000101 |
3 | 111020001210101100122 |
4 | 10301120221131011 |
5 | 40443104342013 |
6 | 2204222351325 |
7 | 240652064105 |
oct | 46130513505 |
9 | 14201711318 |
10 | 5123512133 |
11 | 219a0a8553 |
12 | baba2b545 |
13 | 6386152ac |
14 | 368653205 |
15 | 1eec02a08 |
hex | 131629745 |
5123512133 has 4 divisors (see below), whose sum is σ = 5131263948. Its totient is φ = 5115760320.
The previous prime is 5123512129. The next prime is 5123512171. The reversal of 5123512133 is 3312153215.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4532924929 + 590587204 = 67327^2 + 24302^2 .
It is a cyclic number.
It is not a de Polignac number, because 5123512133 - 22 = 5123512129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5123512103) 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, 3874916 + ... + 3876237.
It is an arithmetic number, because the mean of its divisors is an integer number (1282815987).
Almost surely, 25123512133 is an apocalyptic number.
It is an amenable number.
5123512133 is a deficient number, since it is larger than the sum of its proper divisors (7751815).
5123512133 is an equidigital number, since it uses as much as digits as its factorization.
5123512133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7751814.
The product of its digits is 2700, while the sum is 26.
The square root of 5123512133 is about 71578.7128481646. The cubic root of 5123512133 is about 1723.9417588838.
Adding to 5123512133 its reverse (3312153215), we get a palindrome (8435665348).
The spelling of 5123512133 in words is "five billion, one hundred twenty-three million, five hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •