Base | Representation |
---|---|
bin | 10000001011110100011… |
… | …011000111111001010101 |
3 | 10221022210021212111202102 |
4 | 100023310123013321111 |
5 | 121210242243011201 |
6 | 2210534431251445 |
7 | 143232260451662 |
oct | 20136433077125 |
9 | 3838707774672 |
10 | 1112202313301 |
11 | 399756235642 |
12 | 15b676379b85 |
13 | 80b59b26cc1 |
14 | 3bb8bd0aa69 |
15 | 1dde6d8626b |
hex | 102f46c7e55 |
1112202313301 has 4 divisors (see below), whose sum is σ = 1122596727552. Its totient is φ = 1101807899052.
The previous prime is 1112202313273. The next prime is 1112202313399. The reversal of 1112202313301 is 1033132022111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1112202313301 - 226 = 1112135204437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112202316301) 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, 5197206965 + ... + 5197207178.
It is an arithmetic number, because the mean of its divisors is an integer number (280649181888).
Almost surely, 21112202313301 is an apocalyptic number.
It is an amenable number.
1112202313301 is a deficient number, since it is larger than the sum of its proper divisors (10394414251).
1112202313301 is a wasteful number, since it uses less digits than its factorization.
1112202313301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10394414250.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1112202313301 its reverse (1033132022111), we get a palindrome (2145334335412).
The spelling of 1112202313301 in words is "one trillion, one hundred twelve billion, two hundred two million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •