Base | Representation |
---|---|
bin | 100100100000111… |
… | …1001011010111111 |
3 | 10011101111100020011 |
4 | 1021001321122333 |
5 | 10002124442421 |
6 | 321325004051 |
7 | 42235214053 |
oct | 11101713277 |
9 | 3141440204 |
10 | 1225234111 |
11 | 579681582 |
12 | 2a23b3627 |
13 | 166abb0ca |
14 | b8a1bc63 |
15 | 728724e1 |
hex | 490796bf |
1225234111 has 4 divisors (see below), whose sum is σ = 1264757824. Its totient is φ = 1185710400.
The previous prime is 1225234103. The next prime is 1225234141. The reversal of 1225234111 is 1114325221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1114325221 = 229 ⋅4866049.
It is a cyclic number.
It is not a de Polignac number, because 1225234111 - 23 = 1225234103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225234141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19761810 + ... + 19761871.
It is an arithmetic number, because the mean of its divisors is an integer number (316189456).
Almost surely, 21225234111 is an apocalyptic number.
1225234111 is a deficient number, since it is larger than the sum of its proper divisors (39523713).
1225234111 is an equidigital number, since it uses as much as digits as its factorization.
1225234111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39523712.
The product of its digits is 480, while the sum is 22.
The square root of 1225234111 is about 35003.3442830824. The cubic root of 1225234111 is about 1070.0556383564.
Adding to 1225234111 its reverse (1114325221), we get a palindrome (2339559332).
The spelling of 1225234111 in words is "one billion, two hundred twenty-five million, two hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •