Base | Representation |
---|---|
bin | 111100010001000… |
… | …111111111001001 |
3 | 2121110121022210110 |
4 | 330101013333021 |
5 | 4032321401441 |
6 | 244155504533 |
7 | 34025252622 |
oct | 7421077711 |
9 | 2543538713 |
10 | 1011122121 |
11 | 479830019 |
12 | 242758149 |
13 | 131632719 |
14 | 98404a49 |
15 | 5db7bb16 |
hex | 3c447fc9 |
1011122121 has 8 divisors (see below), whose sum is σ = 1351292544. Its totient is φ = 672516560.
The previous prime is 1011122017. The next prime is 1011122129. The reversal of 1011122121 is 1212211101.
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 1011122121 - 218 = 1010859977 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1011122097 and 1011122106.
It is not an unprimeable number, because it can be changed into a prime (1011122129) 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 7 ways as a sum of consecutive naturals, for example, 389706 + ... + 392291.
It is an arithmetic number, because the mean of its divisors is an integer number (168911568).
Almost surely, 21011122121 is an apocalyptic number.
It is an amenable number.
1011122121 is a deficient number, since it is larger than the sum of its proper divisors (340170423).
1011122121 is an equidigital number, since it uses as much as digits as its factorization.
1011122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782431.
The product of its (nonzero) digits is 8, while the sum is 12.
The square root of 1011122121 is about 31798.1465025872. The cubic root of 1011122121 is about 1003.6937133499.
Adding to 1011122121 its reverse (1212211101), we get a palindrome (2223333222).
The spelling of 1011122121 in words is "one billion, eleven million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •