Base | Representation |
---|---|
bin | 100001011010101… |
… | …1011001011011101 |
3 | 2220010221000002120 |
4 | 1002311123023131 |
5 | 4244023114323 |
6 | 303133213153 |
7 | 36533621514 |
oct | 10265331335 |
9 | 2803830076 |
10 | 1121301213 |
11 | 525a4421a |
12 | 2736311b9 |
13 | 14b3cb456 |
14 | a8cc567b |
15 | 686925e3 |
hex | 42d5b2dd |
1121301213 has 8 divisors (see below), whose sum is σ = 1517383008. Its totient is φ = 736376784.
The previous prime is 1121301197. The next prime is 1121301241. The reversal of 1121301213 is 3121031211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121301213 - 24 = 1121301197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121301192 and 1121301201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121301413) 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, 2789106 + ... + 2789507.
It is an arithmetic number, because the mean of its divisors is an integer number (189672876).
Almost surely, 21121301213 is an apocalyptic number.
It is an amenable number.
1121301213 is a deficient number, since it is larger than the sum of its proper divisors (396081795).
1121301213 is an equidigital number, since it uses as much as digits as its factorization.
1121301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5578683.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1121301213 is about 33485.8360056905. The cubic root of 1121301213 is about 1038.9008397713.
Adding to 1121301213 its reverse (3121031211), we get a palindrome (4242332424).
The spelling of 1121301213 in words is "one billion, one hundred twenty-one million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •