Base | Representation |
---|---|
bin | 11110000000101000011… |
… | …00100111010101011011 |
3 | 10122120112021220012012122 |
4 | 33000110030213111123 |
5 | 113343224014032303 |
6 | 2105410043531455 |
7 | 134332246622261 |
oct | 17002414472533 |
9 | 3576467805178 |
10 | 1031131002203 |
11 | 368333629695 |
12 | 147a0b829b8b |
13 | 76309a777c3 |
14 | 37c9ab80431 |
15 | 1bc4e7ebe38 |
hex | f01432755b |
1031131002203 has 4 divisors (see below), whose sum is σ = 1031353089768. Its totient is φ = 1030908914640.
The previous prime is 1031131002191. The next prime is 1031131002257. The reversal of 1031131002203 is 3022001311301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031131002203 is a prime.
It is a super-2 number, since 2×10311310022032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031134002203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111036818 + ... + 111046103.
It is an arithmetic number, because the mean of its divisors is an integer number (257838272442).
Almost surely, 21031131002203 is an apocalyptic number.
1031131002203 is a deficient number, since it is larger than the sum of its proper divisors (222087565).
1031131002203 is an equidigital number, since it uses as much as digits as its factorization.
1031131002203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222087564.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1031131002203 its reverse (3022001311301), we get a palindrome (4053132313504).
The spelling of 1031131002203 in words is "one trillion, thirty-one billion, one hundred thirty-one million, two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •