Base | Representation |
---|---|
bin | 100101000001010… |
… | …0111100010011111 |
3 | 10012120102022100200 |
4 | 1022002213202133 |
5 | 10021000401343 |
6 | 323132354543 |
7 | 42532345665 |
oct | 11202474237 |
9 | 3176368320 |
10 | 1242200223 |
11 | 58820a460 |
12 | 2a8015a53 |
13 | 16a47b624 |
14 | bad96c35 |
15 | 740c44d3 |
hex | 4a0a789f |
1242200223 has 24 divisors (see below), whose sum is σ = 2010315216. Its totient is φ = 732499200.
The previous prime is 1242200209. The next prime is 1242200227. The reversal of 1242200223 is 3220022421.
1242200223 is a `hidden beast` number, since 1 + 242 + 200 + 223 = 666.
It is not a de Polignac number, because 1242200223 - 229 = 705329311 is a prime.
It is a super-2 number, since 2×12422002232 = 3086122788042499458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1242200196 and 1242200205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1242200227) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 165898 + ... + 173223.
It is an arithmetic number, because the mean of its divisors is an integer number (83763134).
Almost surely, 21242200223 is an apocalyptic number.
1242200223 is a deficient number, since it is larger than the sum of its proper divisors (768114993).
1242200223 is a wasteful number, since it uses less digits than its factorization.
1242200223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339175 (or 339172 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 1242200223 is about 35244.8609445406. The cubic root of 1242200223 is about 1074.9721205678.
Adding to 1242200223 its reverse (3220022421), we get a palindrome (4462222644).
The spelling of 1242200223 in words is "one billion, two hundred forty-two million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •