Base | Representation |
---|---|
bin | 10000001011110100010… |
… | …111010000110000010101 |
3 | 10221022210012222002011021 |
4 | 100023310113100300111 |
5 | 121210242013113023 |
6 | 2210534353441141 |
7 | 143232246034465 |
oct | 20136427206025 |
9 | 3838705862137 |
10 | 1112201301013 |
11 | 399755704040 |
12 | 15b675b701b1 |
13 | 80b5986130a |
14 | 3bb8bb25ba5 |
15 | 1dde6c3635d |
hex | 102f45d0c15 |
1112201301013 has 8 divisors (see below), whose sum is σ = 1252449559296. Its totient is φ = 978476217600.
The previous prime is 1112201301011. The next prime is 1112201301017. The reversal of 1112201301013 is 3101031022111.
It is a happy number.
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 1112201301013 - 21 = 1112201301011 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 (1112201301011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1630793356 + ... + 1630794037.
It is an arithmetic number, because the mean of its divisors is an integer number (156556194912).
Almost surely, 21112201301013 is an apocalyptic number.
It is an amenable number.
1112201301013 is a deficient number, since it is larger than the sum of its proper divisors (140248258283).
1112201301013 is a wasteful number, since it uses less digits than its factorization.
1112201301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3261587435.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1112201301013 its reverse (3101031022111), we get a palindrome (4213232323124).
The spelling of 1112201301013 in words is "one trillion, one hundred twelve billion, two hundred one million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •