Base | Representation |
---|---|
bin | 1001100001011011… |
… | …01100001011110011 |
3 | 111012021121021011012 |
4 | 10300231230023303 |
5 | 40432214013443 |
6 | 2203141141135 |
7 | 240454263140 |
oct | 46055541363 |
9 | 14167537135 |
10 | 5112251123 |
11 | 2193806a31 |
12 | ba80ba7ab |
13 | 6361a1785 |
14 | 366d613c7 |
15 | 1edc2b118 |
hex | 130b6c2f3 |
5112251123 has 8 divisors (see below), whose sum is σ = 5978446848. Its totient is φ = 4280023944.
The previous prime is 5112251117. The next prime is 5112251149. The reversal of 5112251123 is 3211522115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5112251123 - 214 = 5112234739 is a prime.
It is a super-2 number, since 2×51122511232 = 52270223089229522258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5112251623) 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, 8491811 + ... + 8492412.
It is an arithmetic number, because the mean of its divisors is an integer number (747305856).
Almost surely, 25112251123 is an apocalyptic number.
5112251123 is a deficient number, since it is larger than the sum of its proper divisors (866195725).
5112251123 is a wasteful number, since it uses less digits than its factorization.
5112251123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16984273.
The product of its digits is 600, while the sum is 23.
The square root of 5112251123 is about 71500.0078531464. The cubic root of 5112251123 is about 1722.6778104322.
Adding to 5112251123 its reverse (3211522115), we get a palindrome (8323773238).
The spelling of 5112251123 in words is "five billion, one hundred twelve million, two hundred fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •