Base | Representation |
---|---|
bin | 10110110011101110000000… |
… | …110111000111111100101011 |
3 | 111011011122112122101012220012 |
4 | 112303232000313013330223 |
5 | 101121444140010212303 |
6 | 553202143243122135 |
7 | 30062145100135514 |
oct | 2663560067077453 |
9 | 434148478335805 |
10 | 100311123132203 |
11 | 29a647879a2315 |
12 | b300b7421334b |
13 | 43c83b5551989 |
14 | 1aab127317a0b |
15 | b8e4c87415d8 |
hex | 5b3b80dc7f2b |
100311123132203 has 8 divisors (see below), whose sum is σ = 104702053248000. Its totient is φ = 95922657761128.
The previous prime is 100311123132163. The next prime is 100311123132217. The reversal of 100311123132203 is 302231321113001.
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 100311123132203 - 218 = 100311122870059 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100311123132263) 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, 616103003 + ... + 616265796.
It is an arithmetic number, because the mean of its divisors is an integer number (13087756656000).
Almost surely, 2100311123132203 is an apocalyptic number.
100311123132203 is a deficient number, since it is larger than the sum of its proper divisors (4390930115797).
100311123132203 is a wasteful number, since it uses less digits than its factorization.
100311123132203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1232372361.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 100311123132203 its reverse (302231321113001), we get a palindrome (402542444245204).
The spelling of 100311123132203 in words is "one hundred trillion, three hundred eleven billion, one hundred twenty-three million, one hundred thirty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •