Base | Representation |
---|---|
bin | 10000000000101111001… |
… | …010111001010101111011 |
3 | 10220012002000020102202110 |
4 | 100000233022321111323 |
5 | 121011410032410433 |
6 | 2201250000103403 |
7 | 142331351204040 |
oct | 20005712712573 |
9 | 3805060212673 |
10 | 1100303013243 |
11 | 3946aa403365 |
12 | 1592b5304b63 |
13 | 7c9b17bc755 |
14 | 3b37d8231c7 |
15 | 1d94c3a7963 |
hex | 1002f2b957b |
1100303013243 has 8 divisors (see below), whose sum is σ = 1676652210688. Its totient is φ = 628744578984.
The previous prime is 1100303013193. The next prime is 1100303013263. The reversal of 1100303013243 is 3423103030011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100303013243 - 212 = 1100303009147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 52395381583 = 1100303013243 / (1 + 1 + 0 + 0 + 3 + 0 + 3 + 0 + 1 + 3 + 2 + 4 + 3).
It is not an unprimeable number, because it can be changed into a prime (1100303013263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26197690771 + ... + 26197690812.
It is an arithmetic number, because the mean of its divisors is an integer number (209581526336).
Almost surely, 21100303013243 is an apocalyptic number.
1100303013243 is a deficient number, since it is larger than the sum of its proper divisors (576349197445).
1100303013243 is an equidigital number, since it uses as much as digits as its factorization.
1100303013243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52395381593.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1100303013243 its reverse (3423103030011), we get a palindrome (4523406043254).
The spelling of 1100303013243 in words is "one trillion, one hundred billion, three hundred three million, thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •