Base | Representation |
---|---|
bin | 100100011001000… |
… | …1010100101010101 |
3 | 10011002201211011001 |
4 | 1020302022211111 |
5 | 10000101010401 |
6 | 321100343301 |
7 | 42155156521 |
oct | 11062124525 |
9 | 3132654131 |
10 | 1221110101 |
11 | 577315102 |
12 | 2a0b44b31 |
13 | 165ca5c73 |
14 | b8266d81 |
15 | 7230a601 |
hex | 48c8a955 |
1221110101 has 2 divisors, whose sum is σ = 1221110102. Its totient is φ = 1221110100.
The previous prime is 1221110071. The next prime is 1221110123. The reversal of 1221110101 is 1010111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1133668900 + 87441201 = 33670^2 + 9351^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221110101 - 27 = 1221109973 is a prime.
It is a super-2 number, since 2×12211101012 = 2982219757528460402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221110161) 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 as a sum of consecutive naturals, namely, 610555050 + 610555051.
It is an arithmetic number, because the mean of its divisors is an integer number (610555051).
Almost surely, 21221110101 is an apocalyptic number.
It is an amenable number.
1221110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221110101 is an equidigital number, since it uses as much as digits as its factorization.
1221110101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 1221110101 is about 34944.3858294863. The cubic root of 1221110101 is about 1068.8537236814.
Adding to 1221110101 its reverse (1010111221), we get a palindrome (2231221322).
The spelling of 1221110101 in words is "one billion, two hundred twenty-one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •