Base | Representation |
---|---|
bin | 1011011101010000… |
… | …11100101001000011 |
3 | 120212200022102201001 |
4 | 11232220130221003 |
5 | 100044133023011 |
6 | 2454210352431 |
7 | 305300116402 |
oct | 55650345103 |
9 | 16780272631 |
10 | 6151064131 |
11 | 267712a583 |
12 | 1237b8b717 |
13 | 77047b124 |
14 | 424cd3639 |
15 | 2600277c1 |
hex | 16ea1ca43 |
6151064131 has 2 divisors, whose sum is σ = 6151064132. Its totient is φ = 6151064130.
The previous prime is 6151064119. The next prime is 6151064159. The reversal of 6151064131 is 1314601516.
It is an a-pointer prime, because the next prime (6151064159) can be obtained adding 6151064131 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6151064131 - 25 = 6151064099 is a prime.
It is a super-2 number, since 2×61510641312 = 75671179887349570322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6151064131.
It is not a weakly prime, because it can be changed into another prime (6151061131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3075532065 + 3075532066.
It is an arithmetic number, because the mean of its divisors is an integer number (3075532066).
Almost surely, 26151064131 is an apocalyptic number.
6151064131 is a deficient number, since it is larger than the sum of its proper divisors (1).
6151064131 is an equidigital number, since it uses as much as digits as its factorization.
6151064131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 6151064131 is about 78428.7200647824. The cubic root of 6151064131 is about 1832.2444646651.
Adding to 6151064131 its reverse (1314601516), we get a palindrome (7465665647).
The spelling of 6151064131 in words is "six billion, one hundred fifty-one million, sixty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •