Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …101010101100100101001 |
3 | 10221022112022112202201002 |
4 | 100023232131111210221 |
5 | 121210041132332223 |
6 | 2210520454204345 |
7 | 143226633662564 |
oct | 20135635254451 |
9 | 3838468482632 |
10 | 1112102230313 |
11 | 399704797828 |
12 | 15b6489536b5 |
13 | 80b421847b9 |
14 | 3bb7c8d74db |
15 | 1dddd1b6e28 |
hex | 102ee755929 |
1112102230313 has 4 divisors (see below), whose sum is σ = 1112105260500. Its totient is φ = 1112099200128.
The previous prime is 1112102230303. The next prime is 1112102230333. The reversal of 1112102230313 is 3130322012111.
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 522543928384 + 589558301929 = 722872^2 + 767827^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112102230313 - 222 = 1112098036009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1112102230303) 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, 874220 + ... + 1728717.
It is an arithmetic number, because the mean of its divisors is an integer number (278026315125).
Almost surely, 21112102230313 is an apocalyptic number.
It is an amenable number.
1112102230313 is a deficient number, since it is larger than the sum of its proper divisors (3030187).
1112102230313 is an equidigital number, since it uses as much as digits as its factorization.
1112102230313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3030186.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1112102230313 its reverse (3130322012111), we get a palindrome (4242424242424).
The spelling of 1112102230313 in words is "one trillion, one hundred twelve billion, one hundred two million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •