Base | Representation |
---|---|
bin | 10000000001100110101… |
… | …010011010001010001101 |
3 | 10220021110220002112022102 |
4 | 100001212222122022031 |
5 | 121020311402133010 |
6 | 2201522214524445 |
7 | 142363414506266 |
oct | 20014652321215 |
9 | 3807426075272 |
10 | 1101234021005 |
11 | 395037994268 |
12 | 159515066725 |
13 | 7cacc651a11 |
14 | 3b42b33196d |
15 | 1d9a3eabba5 |
hex | 10066a9a28d |
1101234021005 has 4 divisors (see below), whose sum is σ = 1321480825212. Its totient is φ = 880987216800.
The previous prime is 1101234021001. The next prime is 1101234021031. The reversal of 1101234021005 is 5001204321011.
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 417195852649 + 684038168356 = 645907^2 + 827066^2 .
It is not a de Polignac number, because 1101234021005 - 22 = 1101234021001 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 (1101234021001) 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, 110123402096 + ... + 110123402105.
It is an arithmetic number, because the mean of its divisors is an integer number (330370206303).
Almost surely, 21101234021005 is an apocalyptic number.
It is an amenable number.
1101234021005 is a deficient number, since it is larger than the sum of its proper divisors (220246804207).
1101234021005 is an equidigital number, since it uses as much as digits as its factorization.
1101234021005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220246804206.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 1101234021005 its reverse (5001204321011), we get a palindrome (6102438342016).
The spelling of 1101234021005 in words is "one trillion, one hundred one billion, two hundred thirty-four million, twenty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •