Base | Representation |
---|---|
bin | 1011011101010101… |
… | …01001110000001001 |
3 | 120212201101210120002 |
4 | 11232222221300021 |
5 | 100044310021441 |
6 | 2454231012345 |
7 | 305305044452 |
oct | 55652516011 |
9 | 16781353502 |
10 | 6151642121 |
11 | 2677494859 |
12 | 123820a0b5 |
13 | 770621231 |
14 | 425004129 |
15 | 2600ddb9b |
hex | 16eaa9c09 |
6151642121 has 2 divisors, whose sum is σ = 6151642122. Its totient is φ = 6151642120.
The previous prime is 6151642069. The next prime is 6151642153. The reversal of 6151642121 is 1212461516.
6151642121 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6140916496 + 10725625 = 78364^2 + 3275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6151642121 is a prime.
It is a super-2 number, since 2×61516421212 = 75685401569722757282, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (6151642171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3075821060 + 3075821061.
It is an arithmetic number, because the mean of its divisors is an integer number (3075821061).
Almost surely, 26151642121 is an apocalyptic number.
It is an amenable number.
6151642121 is a deficient number, since it is larger than the sum of its proper divisors (1).
6151642121 is an equidigital number, since it uses as much as digits as its factorization.
6151642121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2880, while the sum is 29.
The square root of 6151642121 is about 78432.4047890921. The cubic root of 6151642121 is about 1832.3018523401.
The spelling of 6151642121 in words is "six billion, one hundred fifty-one million, six hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •