Base | Representation |
---|---|
bin | 10000000000100101101… |
… | …101111111001111101101 |
3 | 10220011122221212002120112 |
4 | 100000211231333033231 |
5 | 121011043434042201 |
6 | 2201222133225405 |
7 | 142324414310204 |
oct | 20004555771755 |
9 | 3804587762515 |
10 | 1100144440301 |
11 | 394628946145 |
12 | 159270192265 |
13 | 7c9879ab6ca |
14 | 3b36674623b |
15 | 1d93d4d30bb |
hex | 10025b7f3ed |
1100144440301 has 4 divisors (see below), whose sum is σ = 1100147520732. Its totient is φ = 1100141359872.
The previous prime is 1100144440271. The next prime is 1100144440309. The reversal of 1100144440301 is 1030444410011.
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 652718568100 + 447425872201 = 807910^2 + 668899^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100144440301 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 (1100144440309) 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, 921716 + ... + 1746381.
It is an arithmetic number, because the mean of its divisors is an integer number (275036880183).
Almost surely, 21100144440301 is an apocalyptic number.
It is an amenable number.
1100144440301 is a deficient number, since it is larger than the sum of its proper divisors (3080431).
1100144440301 is an equidigital number, since it uses as much as digits as its factorization.
1100144440301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3080430.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1100144440301 its reverse (1030444410011), we get a palindrome (2130588850312).
The spelling of 1100144440301 in words is "one trillion, one hundred billion, one hundred forty-four million, four hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •