Base | Representation |
---|---|
bin | 100100011001000… |
… | …1111100000111101 |
3 | 10011002202211212012 |
4 | 1020302033200331 |
5 | 10000102132201 |
6 | 321101021005 |
7 | 42155302436 |
oct | 11062174075 |
9 | 3132684765 |
10 | 1221130301 |
11 | 5773292a6 |
12 | 2a0b54765 |
13 | 165cb2211 |
14 | b827048d |
15 | 723115bb |
hex | 48c8f83d |
1221130301 has 4 divisors (see below), whose sum is σ = 1221264672. Its totient is φ = 1220995932.
The previous prime is 1221130291. The next prime is 1221130321. The reversal of 1221130301 is 1030311221.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1030311221 = 11287 ⋅91283.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1221130301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221130321) 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, 52481 + ... + 72086.
It is an arithmetic number, because the mean of its divisors is an integer number (305316168).
Almost surely, 21221130301 is an apocalyptic number.
It is an amenable number.
1221130301 is a deficient number, since it is larger than the sum of its proper divisors (134371).
1221130301 is an equidigital number, since it uses as much as digits as its factorization.
1221130301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134370.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1221130301 is about 34944.6748589824. The cubic root of 1221130301 is about 1068.8596174241.
Adding to 1221130301 its reverse (1030311221), we get a palindrome (2251441522).
The spelling of 1221130301 in words is "one billion, two hundred twenty-one million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •