Base | Representation |
---|---|
bin | 1011011001000110… |
… | …10011011001111111 |
3 | 120210020122011211002 |
4 | 11230203103121333 |
5 | 100011214124101 |
6 | 2450522320515 |
7 | 304364340422 |
oct | 55443233177 |
9 | 16706564732 |
10 | 6116161151 |
11 | 2659460441 |
12 | 122835913b |
13 | 76617a589 |
14 | 4204099b9 |
15 | 25be30d6b |
hex | 16c8d367f |
6116161151 has 16 divisors (see below), whose sum is σ = 6496443648. Its totient is φ = 5749536000.
The previous prime is 6116161147. The next prime is 6116161159. The reversal of 6116161151 is 1511616116.
It is a happy number.
6116161151 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 6116161151 - 22 = 6116161147 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6116161159) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147515 + ... + 184371.
It is an arithmetic number, because the mean of its divisors is an integer number (406027728).
Almost surely, 26116161151 is an apocalyptic number.
6116161151 is a deficient number, since it is larger than the sum of its proper divisors (380282497).
6116161151 is a wasteful number, since it uses less digits than its factorization.
6116161151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37042.
The product of its digits is 1080, while the sum is 29.
The square root of 6116161151 is about 78205.8894904981. The cubic root of 6116161151 is about 1828.7723210952.
Adding to 6116161151 its reverse (1511616116), we get a palindrome (7627777267).
It can be divided in two parts, 611616115 and 1, that added together give a palindrome (611616116).
The spelling of 6116161151 in words is "six billion, one hundred sixteen million, one hundred sixty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •