Base | Representation |
---|---|
bin | 1011100111000011… |
… | …00100001100001001 |
3 | 121002101202122000202 |
4 | 11303201210030021 |
5 | 100231141133441 |
6 | 2510301541545 |
7 | 310314603446 |
oct | 56341441411 |
9 | 17071678022 |
10 | 6233146121 |
11 | 27094a2a34 |
12 | 125b5748b5 |
13 | 78448a057 |
14 | 431b7c9cd |
15 | 26733d19b |
hex | 173864309 |
6233146121 has 2 divisors, whose sum is σ = 6233146122. Its totient is φ = 6233146120.
The previous prime is 6233146111. The next prime is 6233146123. The reversal of 6233146121 is 1216413326.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3765540496 + 2467605625 = 61364^2 + 49675^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6233146121 is a prime.
It is a super-2 number, since 2×62331461212 = 77704221131474693282, which contains 22 as substring.
Together with 6233146123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (6233146123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3116573060 + 3116573061.
It is an arithmetic number, because the mean of its divisors is an integer number (3116573061).
Almost surely, 26233146121 is an apocalyptic number.
It is an amenable number.
6233146121 is a deficient number, since it is larger than the sum of its proper divisors (1).
6233146121 is an equidigital number, since it uses as much as digits as its factorization.
6233146121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184, while the sum is 29.
The square root of 6233146121 is about 78950.2762566414. The cubic root of 6233146121 is about 1840.3585195567.
Adding to 6233146121 its reverse (1216413326), we get a palindrome (7449559447).
The spelling of 6233146121 in words is "six billion, two hundred thirty-three million, one hundred forty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •