Base | Representation |
---|---|
bin | 100001100001000… |
… | …0101100010011001 |
3 | 2220101011122012221 |
4 | 1003002011202121 |
5 | 4300400323231 |
6 | 303332304041 |
7 | 36604054540 |
oct | 10302054231 |
9 | 2811148187 |
10 | 1124620441 |
11 | 527900a8a |
12 | 274772021 |
13 | 14bcc11a9 |
14 | a950b157 |
15 | 68aead11 |
hex | 43085899 |
1124620441 has 8 divisors (see below), whose sum is σ = 1291740800. Its totient is φ = 959115168.
The previous prime is 1124620421. The next prime is 1124620451. The reversal of 1124620441 is 1440264211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1124620441 - 27 = 1124620313 is a prime.
It is a super-2 number, since 2×11246204412 = 2529542272630068962, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1124620411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 402276 + ... + 405061.
It is an arithmetic number, because the mean of its divisors is an integer number (161467600).
Almost surely, 21124620441 is an apocalyptic number.
It is an amenable number.
1124620441 is a deficient number, since it is larger than the sum of its proper divisors (167120359).
1124620441 is an equidigital number, since it uses as much as digits as its factorization.
1124620441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807543.
The product of its (nonzero) digits is 1536, while the sum is 25.
The square root of 1124620441 is about 33535.3610536699. The cubic root of 1124620441 is about 1039.9249332529.
Adding to 1124620441 its reverse (1440264211), we get a palindrome (2564884652).
The spelling of 1124620441 in words is "one billion, one hundred twenty-four million, six hundred twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •