Base | Representation |
---|---|
bin | 1001101101001101… |
… | …00111011110100011 |
3 | 111110011112021122002 |
4 | 10312212213132203 |
5 | 41133012411011 |
6 | 2221031034215 |
7 | 243064165064 |
oct | 46646473643 |
9 | 14404467562 |
10 | 5211060131 |
11 | 2234564672 |
12 | 101520b96b |
13 | 6507b9144 |
14 | 37612256b |
15 | 207747c3b |
hex | 1369a77a3 |
5211060131 has 8 divisors (see below), whose sum is σ = 5416383504. Its totient is φ = 5009130720.
The previous prime is 5211060091. The next prime is 5211060143. The reversal of 5211060131 is 1310601125.
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 5211060131 - 210 = 5211059107 is a prime.
It is a super-2 number, since 2×52110601312 = 54310295377795474322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5211060181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 845360 + ... + 851501.
It is an arithmetic number, because the mean of its divisors is an integer number (677047938).
Almost surely, 25211060131 is an apocalyptic number.
5211060131 is a deficient number, since it is larger than the sum of its proper divisors (205323373).
5211060131 is a wasteful number, since it uses less digits than its factorization.
5211060131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1696981.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 5211060131 is about 72187.6729850741. The cubic root of 5211060131 is about 1733.7056380451.
Adding to 5211060131 its reverse (1310601125), we get a palindrome (6521661256).
The spelling of 5211060131 in words is "five billion, two hundred eleven million, sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •