Base | Representation |
---|---|
bin | 100100100000100… |
… | …0100001110011111 |
3 | 10011101002021100020 |
4 | 1021001010032133 |
5 | 10002101004343 |
6 | 321320203223 |
7 | 42233315604 |
oct | 11101041637 |
9 | 3141067306 |
10 | 1225016223 |
11 | 579542902 |
12 | 2a2309513 |
13 | 166a42b92 |
14 | b89a26ab |
15 | 7282cb83 |
hex | 4904439f |
1225016223 has 4 divisors (see below), whose sum is σ = 1633354968. Its totient is φ = 816677480.
The previous prime is 1225016197. The next prime is 1225016237. The reversal of 1225016223 is 3226105221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1225016223 - 26 = 1225016159 is a prime.
It is a super-2 number, since 2×12250162232 = 3001329493226371458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1225016193 and 1225016202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225016123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 204169368 + ... + 204169373.
It is an arithmetic number, because the mean of its divisors is an integer number (408338742).
Almost surely, 21225016223 is an apocalyptic number.
1225016223 is a deficient number, since it is larger than the sum of its proper divisors (408338745).
1225016223 is an equidigital number, since it uses as much as digits as its factorization.
1225016223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408338744.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 1225016223 is about 35000.2317563756. The cubic root of 1225016223 is about 1069.9922039203.
The spelling of 1225016223 in words is "one billion, two hundred twenty-five million, sixteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •