Base | Representation |
---|---|
bin | 1001100001010110… |
… | …01110110101100111 |
3 | 111012020101112002010 |
4 | 10300223032311213 |
5 | 40432032403011 |
6 | 2203115245303 |
7 | 240445640145 |
oct | 46053166547 |
9 | 14166345063 |
10 | 5111606631 |
11 | 219340679a |
12 | ba7a49833 |
13 | 636007311 |
14 | 366c34595 |
15 | 1edb501a6 |
hex | 130aced67 |
5111606631 has 8 divisors (see below), whose sum is σ = 7216385904. Its totient is φ = 3207282560.
The previous prime is 5111606627. The next prime is 5111606681. The reversal of 5111606631 is 1366061115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5111606631 - 22 = 5111606627 is a prime.
It is a super-2 number, since 2×51116066312 = 52257044700166340322, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111606681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50113740 + ... + 50113841.
It is an arithmetic number, because the mean of its divisors is an integer number (902048238).
Almost surely, 25111606631 is an apocalyptic number.
5111606631 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5111606631 is a deficient number, since it is larger than the sum of its proper divisors (2104779273).
5111606631 is a wasteful number, since it uses less digits than its factorization.
5111606631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100227601.
The product of its (nonzero) digits is 3240, while the sum is 30.
The square root of 5111606631 is about 71495.5007745243. The cubic root of 5111606631 is about 1722.6054157930.
Adding to 5111606631 its reverse (1366061115), we get a palindrome (6477667746).
The spelling of 5111606631 in words is "five billion, one hundred eleven million, six hundred six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •