Base | Representation |
---|---|
bin | 1001110000000000… |
… | …00010100101111011 |
3 | 111111210122020211212 |
4 | 10320000002211323 |
5 | 41210013031021 |
6 | 2223225313335 |
7 | 243500350544 |
oct | 47000024573 |
9 | 14453566755 |
10 | 5234502011 |
11 | 2246815922 |
12 | 102103584b |
13 | 65560608b |
14 | 3792a54cb |
15 | 20982885b |
hex | 13800297b |
5234502011 has 8 divisors (see below), whose sum is σ = 5618338704. Its totient is φ = 4859101440.
The previous prime is 5234501971. The next prime is 5234502019. The reversal of 5234502011 is 1102054325.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5234502011 is a prime.
It is a super-2 number, since 2×52345020112 = 54800022606326088242, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5234502019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2107745 + ... + 2110226.
It is an arithmetic number, because the mean of its divisors is an integer number (702292338).
Almost surely, 25234502011 is an apocalyptic number.
5234502011 is a deficient number, since it is larger than the sum of its proper divisors (383836693).
5234502011 is a wasteful number, since it uses less digits than its factorization.
5234502011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4218061.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 5234502011 is about 72349.8584034551. The cubic root of 5234502011 is about 1736.3014329431.
Adding to 5234502011 its reverse (1102054325), we get a palindrome (6336556336).
The spelling of 5234502011 in words is "five billion, two hundred thirty-four million, five hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •