Base | Representation |
---|---|
bin | 100001011010001… |
… | …0110110001010101 |
3 | 2220010101202201210 |
4 | 1002310112301111 |
5 | 4243440133023 |
6 | 303123212033 |
7 | 36531343560 |
oct | 10264266125 |
9 | 2803352653 |
10 | 1121021013 |
11 | 525872752 |
12 | 273517019 |
13 | 14b330a58 |
14 | a8c514d7 |
15 | 68639593 |
hex | 42d16c55 |
1121021013 has 32 divisors (see below), whose sum is σ = 1769932800. Its totient is φ = 617512896.
The previous prime is 1121020993. The next prime is 1121021093. The reversal of 1121021013 is 3101201211.
It is not a de Polignac number, because 1121021013 - 28 = 1121020757 is a prime.
It is a super-2 number, since 2×11210210132 = 2513376223175092338, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121021013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121021093) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 558670 + ... + 560672.
It is an arithmetic number, because the mean of its divisors is an integer number (55310400).
Almost surely, 21121021013 is an apocalyptic number.
It is an amenable number.
1121021013 is a deficient number, since it is larger than the sum of its proper divisors (648911787).
1121021013 is a wasteful number, since it uses less digits than its factorization.
1121021013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2961.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1121021013 is about 33481.6518857717. The cubic root of 1121021013 is about 1038.8142961906.
Adding to 1121021013 its reverse (3101201211), we get a palindrome (4222222224).
It can be divided in two parts, 11210 and 21013, that added together give a palindrome (32223).
The spelling of 1121021013 in words is "one billion, one hundred twenty-one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •