Base | Representation |
---|---|
bin | 10000010011000111000… |
… | …011100111100000101101 |
3 | 10222001222220010122112122 |
4 | 100103013003213200231 |
5 | 121322310431024323 |
6 | 2214311333442325 |
7 | 143630262235460 |
oct | 20230703474055 |
9 | 3861886118478 |
10 | 1120031111213 |
11 | 3a20033aa363 |
12 | 1610a01a03a5 |
13 | 81806a568c1 |
14 | 3c2d196b2d7 |
15 | 1e204314ec8 |
hex | 104c70e782d |
1120031111213 has 8 divisors (see below), whose sum is σ = 1285016240832. Its totient is φ = 956291152896.
The previous prime is 1120031111191. The next prime is 1120031111279. The reversal of 1120031111213 is 3121111300211.
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 1120031111213 - 222 = 1120026916909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120031111191 and 1120031111200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120031111513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 311290895 + ... + 311294492.
It is an arithmetic number, because the mean of its divisors is an integer number (160627030104).
Almost surely, 21120031111213 is an apocalyptic number.
It is an amenable number.
1120031111213 is a deficient number, since it is larger than the sum of its proper divisors (164985129619).
1120031111213 is an equidigital number, since it uses as much as digits as its factorization.
1120031111213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 622585651.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1120031111213 its reverse (3121111300211), we get a palindrome (4241142411424).
The spelling of 1120031111213 in words is "one trillion, one hundred twenty billion, thirty-one million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •