Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …011101010111011100101 |
3 | 10221022021021022100102221 |
4 | 100023220123222323211 |
5 | 121204334242131323 |
6 | 2210502443232341 |
7 | 143224265436241 |
oct | 20135033527345 |
9 | 3838237270387 |
10 | 1112001130213 |
11 | 399662714826 |
12 | 15b61ab186b1 |
13 | 80b2724735c |
14 | 3bb6d2db421 |
15 | 1ddd439655d |
hex | 102e86eaee5 |
1112001130213 has 4 divisors (see below), whose sum is σ = 1177412961420. Its totient is φ = 1046589299008.
The previous prime is 1112001130199. The next prime is 1112001130217. The reversal of 1112001130213 is 3120311002111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 980767373569 + 131233756644 = 990337^2 + 362262^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112001130213 - 237 = 974562176741 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 (1112001130217) 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, 32705915578 + ... + 32705915611.
It is an arithmetic number, because the mean of its divisors is an integer number (294353240355).
Almost surely, 21112001130213 is an apocalyptic number.
It is an amenable number.
1112001130213 is a deficient number, since it is larger than the sum of its proper divisors (65411831207).
1112001130213 is an equidigital number, since it uses as much as digits as its factorization.
1112001130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65411831206.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1112001130213 its reverse (3120311002111), we get a palindrome (4232312132324).
The spelling of 1112001130213 in words is "one trillion, one hundred twelve billion, one million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •