Base | Representation |
---|---|
bin | 100001011010001… |
… | …0100100100101101 |
3 | 2220010101022101110 |
4 | 1002310110210231 |
5 | 4243434341023 |
6 | 303123102233 |
7 | 36531305412 |
oct | 10264244455 |
9 | 2803338343 |
10 | 1121012013 |
11 | 525866a10 |
12 | 273511979 |
13 | 14b329924 |
14 | a8c4c109 |
15 | 68636a93 |
hex | 42d1492d |
1121012013 has 8 divisors (see below), whose sum is σ = 1630562976. Its totient is φ = 679401200.
The previous prime is 1121011967. The next prime is 1121012047. The reversal of 1121012013 is 3102101211.
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 1121012013 - 28 = 1121011757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1121012013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121012513) 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 in 7 ways as a sum of consecutive naturals, for example, 16984998 + ... + 16985063.
It is an arithmetic number, because the mean of its divisors is an integer number (203820372).
Almost surely, 21121012013 is an apocalyptic number.
It is an amenable number.
1121012013 is a deficient number, since it is larger than the sum of its proper divisors (509550963).
1121012013 is a wasteful number, since it uses less digits than its factorization.
1121012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33970075.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1121012013 is about 33481.5174835311. The cubic root of 1121012013 is about 1038.8115161791.
Adding to 1121012013 its reverse (3102101211), we get a palindrome (4223113224).
The spelling of 1121012013 in words is "one billion, one hundred twenty-one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •