Base | Representation |
---|---|
bin | 1001110011110010… |
… | …00101001011001011 |
3 | 111121000100022020001 |
4 | 10321321011023023 |
5 | 41241123411021 |
6 | 2230321343431 |
7 | 244334143045 |
oct | 47171051313 |
9 | 14530308201 |
10 | 5266232011 |
11 | 2262718067 |
12 | 102b797b77 |
13 | 65c065621 |
14 | 37d5a4a95 |
15 | 20c4e5091 |
hex | 139e452cb |
5266232011 has 8 divisors (see below), whose sum is σ = 5354082000. Its totient is φ = 5179082400.
The previous prime is 5266232009. The next prime is 5266232017. The reversal of 5266232011 is 1102326625.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5266232011 - 21 = 5266232009 is a prime.
It is a super-2 number, since 2×52662320112 = 55466399187362208242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5266232017) 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, 159921 + ... + 190018.
It is an arithmetic number, because the mean of its divisors is an integer number (669260250).
Almost surely, 25266232011 is an apocalyptic number.
5266232011 is a deficient number, since it is larger than the sum of its proper divisors (87849989).
5266232011 is a wasteful number, since it uses less digits than its factorization.
5266232011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350189.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 5266232011 is about 72568.8088024049. The cubic root of 5266232011 is about 1739.8026828480.
Adding to 5266232011 its reverse (1102326625), we get a palindrome (6368558636).
The spelling of 5266232011 in words is "five billion, two hundred sixty-six million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •