Base | Representation |
---|---|
bin | 111100010001011… |
… | …111111010011001 |
3 | 2121110210022020002 |
4 | 330101133322121 |
5 | 4032333020441 |
6 | 244201542345 |
7 | 34026141422 |
oct | 7421377231 |
9 | 2543708202 |
10 | 1011220121 |
11 | 47989770a |
12 | 2427a49b5 |
13 | 131668202 |
14 | 9842c649 |
15 | 5db9ab9b |
hex | 3c45fe99 |
1011220121 has 4 divisors (see below), whose sum is σ = 1034736912. Its totient is φ = 987703332.
The previous prime is 1011220097. The next prime is 1011220123. The reversal of 1011220121 is 1210221101.
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 a de Polignac number, because none of the positive numbers 2k-1011220121 is a prime.
It is a super-2 number, since 2×10112201212 = 2045132266230509282, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011220123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11758331 + ... + 11758416.
It is an arithmetic number, because the mean of its divisors is an integer number (258684228).
Almost surely, 21011220121 is an apocalyptic number.
It is an amenable number.
1011220121 is a deficient number, since it is larger than the sum of its proper divisors (23516791).
1011220121 is an equidigital number, since it uses as much as digits as its factorization.
1011220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23516790.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1011220121 is about 31799.6874355708. The cubic root of 1011220121 is about 1003.7261389769.
Adding to 1011220121 its reverse (1210221101), we get a palindrome (2221441222).
The spelling of 1011220121 in words is "one billion, eleven million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •