Base | Representation |
---|---|
bin | 11110000000011000110… |
… | …10000110100011001011 |
3 | 10122120012011222212012120 |
4 | 33000030122012203023 |
5 | 113342442040221303 |
6 | 2105345054542323 |
7 | 134326102061220 |
oct | 17001432064313 |
9 | 3576164885176 |
10 | 1031000320203 |
11 | 368276891337 |
12 | 147993b079a3 |
13 | 762b8980789 |
14 | 37c87683947 |
15 | 1bc430d6553 |
hex | f00c6868cb |
1031000320203 has 64 divisors (see below), whose sum is σ = 1717277322240. Its totient is φ = 536704745472.
The previous prime is 1031000320183. The next prime is 1031000320223. The reversal of 1031000320203 is 3020230001301.
It is an interprime number because it is at equal distance from previous prime (1031000320183) and next prime (1031000320223).
It is not a de Polignac number, because 1031000320203 - 212 = 1031000316107 is a prime.
It is a super-2 number, since 2×10310003202032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1031000320223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2347128 + ... + 2751546.
It is an arithmetic number, because the mean of its divisors is an integer number (26832458160).
Almost surely, 21031000320203 is an apocalyptic number.
1031000320203 is a deficient number, since it is larger than the sum of its proper divisors (686277002037).
1031000320203 is a wasteful number, since it uses less digits than its factorization.
1031000320203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404676.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1031000320203 its reverse (3020230001301), we get a palindrome (4051230321504).
The spelling of 1031000320203 in words is "one trillion, thirty-one billion, three hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •