Base | Representation |
---|---|
bin | 1011011101001101… |
… | …10111110011001001 |
3 | 120212122112110002220 |
4 | 11232212313303021 |
5 | 100044031313311 |
6 | 2454153444253 |
7 | 305263446231 |
oct | 55646676311 |
9 | 16778473086 |
10 | 6150651081 |
11 | 2676978213 |
12 | 1237a10689 |
13 | 770365113 |
14 | 424c26cc1 |
15 | 25ee95206 |
hex | 16e9b7cc9 |
6150651081 has 16 divisors (see below), whose sum is σ = 8429754624. Its totient is φ = 3986181504.
The previous prime is 6150651079. The next prime is 6150651083. The reversal of 6150651081 is 1801560516.
It is an interprime number because it is at equal distance from previous prime (6150651079) and next prime (6150651083).
It is not a de Polignac number, because 6150651081 - 21 = 6150651079 is a prime.
It is a super-2 number, since 2×61506510812 = 75661017440412937122, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6150651083) 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, 109200 + ... + 155646.
It is an arithmetic number, because the mean of its divisors is an integer number (526859664).
Almost surely, 26150651081 is an apocalyptic number.
It is an amenable number.
6150651081 is a deficient number, since it is larger than the sum of its proper divisors (2279103543).
6150651081 is a wasteful number, since it uses less digits than its factorization.
6150651081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47680.
The product of its (nonzero) digits is 7200, while the sum is 33.
The square root of 6150651081 is about 78426.0867377686. The cubic root of 6150651081 is about 1832.2034514083.
It can be divided in two parts, 6150 and 651081, that added together give a triangular number (657231 = T1146).
The spelling of 6150651081 in words is "six billion, one hundred fifty million, six hundred fifty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •