Base | Representation |
---|---|
bin | 10000001001111111100… |
… | …111001110010011100101 |
3 | 10221010201201020021021222 |
4 | 100021333213032103211 |
5 | 121142234043113023 |
6 | 2210012142550125 |
7 | 143132562655211 |
oct | 20117747162345 |
9 | 3833651207258 |
10 | 1110242551013 |
11 | 39893aa81192 |
12 | 15b209b98345 |
13 | 80906aca74b |
14 | 3ba43927941 |
15 | 1dd2ecc0cc8 |
hex | 1027f9ce4e5 |
1110242551013 has 4 divisors (see below), whose sum is σ = 1148526776940. Its totient is φ = 1071958325088.
The previous prime is 1110242551007. The next prime is 1110242551027. The reversal of 1110242551013 is 3101552420111.
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 617722118209 + 492520432804 = 785953^2 + 701798^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110242551013 - 24 = 1110242550997 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 (1110242511013) 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, 19142112920 + ... + 19142112977.
It is an arithmetic number, because the mean of its divisors is an integer number (287131694235).
Almost surely, 21110242551013 is an apocalyptic number.
It is an amenable number.
1110242551013 is a deficient number, since it is larger than the sum of its proper divisors (38284225927).
1110242551013 is an equidigital number, since it uses as much as digits as its factorization.
1110242551013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38284225926.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 1110242551013 its reverse (3101552420111), we get a palindrome (4211794971124).
The spelling of 1110242551013 in words is "one trillion, one hundred ten billion, two hundred forty-two million, five hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •