Base | Representation |
---|---|
bin | 1001100010101110… |
… | …01100111001010011 |
3 | 111020001002010022002 |
4 | 10301113030321103 |
5 | 40443010224021 |
6 | 2204210304215 |
7 | 240645624563 |
oct | 46127147123 |
9 | 14201063262 |
10 | 5123133011 |
11 | 2199969727 |
12 | bab88806b |
13 | 638511869 |
14 | 368594da3 |
15 | 1eeb7a50b |
hex | 1315cce53 |
5123133011 has 8 divisors (see below), whose sum is σ = 5399790480. Its totient is φ = 4853142112.
The previous prime is 5123132951. The next prime is 5123133023. The reversal of 5123133011 is 1103313215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5123133011 is a prime.
It is a super-2 number, since 2×51231330112 = 52492983696795852242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5123133511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1665065 + ... + 1668138.
It is an arithmetic number, because the mean of its divisors is an integer number (674973810).
Almost surely, 25123133011 is an apocalyptic number.
5123133011 is a deficient number, since it is larger than the sum of its proper divisors (276657469).
5123133011 is a wasteful number, since it uses less digits than its factorization.
5123133011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333285.
The product of its (nonzero) digits is 270, while the sum is 20.
The square root of 5123133011 is about 71576.0645118185. The cubic root of 5123133011 is about 1723.8992359456.
Adding to 5123133011 its reverse (1103313215), we get a palindrome (6226446226).
The spelling of 5123133011 in words is "five billion, one hundred twenty-three million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •