Base | Representation |
---|---|
bin | 100001100000010… |
… | …1001101100011101 |
3 | 2220100110112012001 |
4 | 1003000221230131 |
5 | 4300301304003 |
6 | 303320242301 |
7 | 36600630016 |
oct | 10300515435 |
9 | 2810415161 |
10 | 1124244253 |
11 | 527674390 |
12 | 274610391 |
13 | 14bbbbbb2 |
14 | a945000d |
15 | 68a7461d |
hex | 43029b1d |
1124244253 has 4 divisors (see below), whose sum is σ = 1226448288. Its totient is φ = 1022040220.
The previous prime is 1124244241. The next prime is 1124244257. The reversal of 1124244253 is 3524424211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1124244253 - 29 = 1124243741 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 (1124244257) 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, 51102001 + ... + 51102022.
It is an arithmetic number, because the mean of its divisors is an integer number (306612072).
Almost surely, 21124244253 is an apocalyptic number.
It is an amenable number.
1124244253 is a deficient number, since it is larger than the sum of its proper divisors (102204035).
1124244253 is a wasteful number, since it uses less digits than its factorization.
1124244253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102204034.
The product of its digits is 7680, while the sum is 28.
The square root of 1124244253 is about 33529.7517586993. The cubic root of 1124244253 is about 1039.8089679327.
Adding to 1124244253 its reverse (3524424211), we get a palindrome (4648668464).
The spelling of 1124244253 in words is "one billion, one hundred twenty-four million, two hundred forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •