Base | Representation |
---|---|
bin | 1001100001011011… |
… | …01110111001001111 |
3 | 111012021121211101022 |
4 | 10300231232321033 |
5 | 40432214342343 |
6 | 2203141304355 |
7 | 240454340405 |
oct | 46055567117 |
9 | 14167554338 |
10 | 5112262223 |
11 | 2193814302 |
12 | ba81050bb |
13 | 6361a6843 |
14 | 366d65475 |
15 | 1edc2e568 |
hex | 130b6ee4f |
5112262223 has 2 divisors, whose sum is σ = 5112262224. Its totient is φ = 5112262222.
The previous prime is 5112262201. The next prime is 5112262229. The reversal of 5112262223 is 3222622115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5112262223 - 26 = 5112262159 is a prime.
It is a super-2 number, since 2×51122622232 = 52270450073425803458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5112262192 and 5112262201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5112262229) 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, 2556131111 + 2556131112.
It is an arithmetic number, because the mean of its divisors is an integer number (2556131112).
Almost surely, 25112262223 is an apocalyptic number.
5112262223 is a deficient number, since it is larger than the sum of its proper divisors (1).
5112262223 is an equidigital number, since it uses as much as digits as its factorization.
5112262223 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 26.
The square root of 5112262223 is about 71500.0854754734. The cubic root of 5112262223 is about 1722.6790572221.
Adding to 5112262223 its reverse (3222622115), we get a palindrome (8334884338).
The spelling of 5112262223 in words is "five billion, one hundred twelve million, two hundred sixty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •