Base | Representation |
---|---|
bin | 10000010011000110111… |
… | …111011000100000111101 |
3 | 10222001222211001020220112 |
4 | 100103012333120200331 |
5 | 121322310140014323 |
6 | 2214311253555405 |
7 | 143630246633354 |
oct | 20230677304075 |
9 | 3861884036815 |
10 | 1120030001213 |
11 | 3a2002811402 |
12 | 16109b945b65 |
13 | 818067585b6 |
14 | 3c2d175c99b |
15 | 1e204196178 |
hex | 104c6fd883d |
1120030001213 has 4 divisors (see below), whose sum is σ = 1120575560988. Its totient is φ = 1119484441440.
The previous prime is 1120030001197. The next prime is 1120030001219. The reversal of 1120030001213 is 3121000300211.
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 789677495044 + 330352506169 = 888638^2 + 574763^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120030001213 - 24 = 1120030001197 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 (1120030001219) 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, 272776808 + ... + 272780913.
It is an arithmetic number, because the mean of its divisors is an integer number (280143890247).
Almost surely, 21120030001213 is an apocalyptic number.
It is an amenable number.
1120030001213 is a deficient number, since it is larger than the sum of its proper divisors (545559775).
1120030001213 is an equidigital number, since it uses as much as digits as its factorization.
1120030001213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545559774.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1120030001213 its reverse (3121000300211), we get a palindrome (4241030301424).
The spelling of 1120030001213 in words is "one trillion, one hundred twenty billion, thirty million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •