Base | Representation |
---|---|
bin | 10000000011011101101… |
… | …101100000000010001001 |
3 | 10220110122002100211201201 |
4 | 100003131231200002021 |
5 | 121033404204221301 |
6 | 2202452323544201 |
7 | 142464046332103 |
oct | 20033555400211 |
9 | 3813562324651 |
10 | 1103231320201 |
11 | 39597235675a |
12 | 159991b2b061 |
13 | 8005a39196a |
14 | 3b57a6c6573 |
15 | 1da6e4d9201 |
hex | 100ddb60089 |
1103231320201 has 8 divisors (see below), whose sum is σ = 1109014928424. Its totient is φ = 1097448407040.
The previous prime is 1103231320171. The next prime is 1103231320207. The reversal of 1103231320201 is 1020231323011.
It can be written as a sum of positive squares in 4 ways, for example, as 19789736976 + 1083441583225 = 140676^2 + 1040885^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1103231320201 - 211 = 1103231318153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1103231320207) 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, 3177945 + ... + 3507961.
It is an arithmetic number, because the mean of its divisors is an integer number (138626866053).
Almost surely, 21103231320201 is an apocalyptic number.
It is an amenable number.
1103231320201 is a deficient number, since it is larger than the sum of its proper divisors (5783608223).
1103231320201 is a wasteful number, since it uses less digits than its factorization.
1103231320201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347531.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1103231320201 its reverse (1020231323011), we get a palindrome (2123462643212).
The spelling of 1103231320201 in words is "one trillion, one hundred three billion, two hundred thirty-one million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •