Base | Representation |
---|---|
bin | 1011100111111001… |
… | …0011000110011011 |
3 | 22001110001022200102 |
4 | 2321332103012123 |
5 | 22342222203443 |
6 | 1233334530015 |
7 | 140214356315 |
oct | 27176230633 |
9 | 8043038612 |
10 | 3120116123 |
11 | 1361251473 |
12 | 730b0690b |
13 | 3a954c277 |
14 | 2185527b5 |
15 | 133dbdcb8 |
hex | b9f9319b |
3120116123 has 2 divisors, whose sum is σ = 3120116124. Its totient is φ = 3120116122.
The previous prime is 3120116101. The next prime is 3120116137. The reversal of 3120116123 is 3216110213.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3120116123 - 214 = 3120099739 is a prime.
It is a super-2 number, since 2×31201161232 = 19470249242009102258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3120116095 and 3120116104.
It is not a weakly prime, because it can be changed into another prime (3120116183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560058061 + 1560058062.
It is an arithmetic number, because the mean of its divisors is an integer number (1560058062).
Almost surely, 23120116123 is an apocalyptic number.
3120116123 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120116123 is an equidigital number, since it uses as much as digits as its factorization.
3120116123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 3120116123 is about 55857.9996329980. Note that the first 3 decimals coincide. The cubic root of 3120116123 is about 1461.2468430345.
Adding to 3120116123 its reverse (3216110213), we get a palindrome (6336226336).
The spelling of 3120116123 in words is "three billion, one hundred twenty million, one hundred sixteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •