Base | Representation |
---|---|
bin | 100001011111111… |
… | …0011011101101001 |
3 | 2220100001020110221 |
4 | 1002333303131221 |
5 | 4300222201441 |
6 | 303311410041 |
7 | 36566013265 |
oct | 10277633551 |
9 | 2810036427 |
10 | 1124022121 |
11 | 527532502 |
12 | 274523921 |
13 | 14bb41a61 |
14 | a93d30a5 |
15 | 68a2d8d1 |
hex | 42ff3769 |
1124022121 has 8 divisors (see below), whose sum is σ = 1234624320. Its totient is φ = 1018564272.
The previous prime is 1124022091. The next prime is 1124022131. The reversal of 1124022121 is 1212204211.
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 1124022121 - 25 = 1124022089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1124022095 and 1124022104.
It is not an unprimeable number, because it can be changed into a prime (1124022131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1285630 + ... + 1286503.
It is an arithmetic number, because the mean of its divisors is an integer number (154328040).
Almost surely, 21124022121 is an apocalyptic number.
It is an amenable number.
1124022121 is a deficient number, since it is larger than the sum of its proper divisors (110602199).
1124022121 is a wasteful number, since it uses less digits than its factorization.
1124022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2572175.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 1124022121 is about 33526.4391339134. The cubic root of 1124022121 is about 1039.7404804254.
Adding to 1124022121 its reverse (1212204211), we get a palindrome (2336226332).
The spelling of 1124022121 in words is "one billion, one hundred twenty-four million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •