Base | Representation |
---|---|
bin | 1001110000000001… |
… | …00010001101010111 |
3 | 111111210212211111011 |
4 | 10320000202031113 |
5 | 41210031202021 |
6 | 2223232153051 |
7 | 243501430234 |
oct | 47000421527 |
9 | 14453784434 |
10 | 5234631511 |
11 | 22468a414a |
12 | 1021098787 |
13 | 65564ccc5 |
14 | 3792da78b |
15 | 209851de1 |
hex | 138022357 |
5234631511 has 8 divisors (see below), whose sum is σ = 5405470848. Its totient is φ = 5063916000.
The previous prime is 5234631509. The next prime is 5234631539. The reversal of 5234631511 is 1151364325.
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 5234631511 - 21 = 5234631509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5234631011) 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, 59181 + ... + 118201.
It is an arithmetic number, because the mean of its divisors is an integer number (675683856).
Almost surely, 25234631511 is an apocalyptic number.
5234631511 is a deficient number, since it is larger than the sum of its proper divisors (170839337).
5234631511 is a wasteful number, since it uses less digits than its factorization.
5234631511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61913.
The product of its digits is 10800, while the sum is 31.
The square root of 5234631511 is about 72350.7533547509. The cubic root of 5234631511 is about 1736.3157513495.
Adding to 5234631511 its reverse (1151364325), we get a palindrome (6385995836).
The spelling of 5234631511 in words is "five billion, two hundred thirty-four million, six hundred thirty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •