Base | Representation |
---|---|
bin | 100100100010110… |
… | …1010110000011111 |
3 | 10011110100120012201 |
4 | 1021011222300133 |
5 | 10002403110443 |
6 | 321402112331 |
7 | 42246502033 |
oct | 11105526037 |
9 | 3143316181 |
10 | 1226222623 |
11 | 57a19722a |
12 | 2a27ab6a7 |
13 | 167076022 |
14 | b8bd81c3 |
15 | 729ba34d |
hex | 4916ac1f |
1226222623 has 2 divisors, whose sum is σ = 1226222624. Its totient is φ = 1226222622.
The previous prime is 1226222609. The next prime is 1226222651. The reversal of 1226222623 is 3262226221.
It is an a-pointer prime, because the next prime (1226222651) can be obtained adding 1226222623 to its sum of digits (28).
It is a weak prime.
It is an emirp because it is prime and its reverse (3262226221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1226222623 - 29 = 1226222111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1226222591 and 1226222600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1226222603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 613111311 + 613111312.
It is an arithmetic number, because the mean of its divisors is an integer number (613111312).
Almost surely, 21226222623 is an apocalyptic number.
1226222623 is a deficient number, since it is larger than the sum of its proper divisors (1).
1226222623 is an equidigital number, since it uses as much as digits as its factorization.
1226222623 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 28.
The square root of 1226222623 is about 35017.4616869927. The cubic root of 1226222623 is about 1070.3433326268.
Adding to 1226222623 its reverse (3262226221), we get a palindrome (4488448844).
The spelling of 1226222623 in words is "one billion, two hundred twenty-six million, two hundred twenty-two thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •