Base | Representation |
---|---|
bin | 11110000000011001001… |
… | …01001010110010001101 |
3 | 10122120012101110020112102 |
4 | 33000030211022302031 |
5 | 113342443311034013 |
6 | 2105345241044445 |
7 | 134326135532564 |
oct | 17001445126215 |
9 | 3576171406472 |
10 | 1031003221133 |
11 | 3682784928a6 |
12 | 147994a86725 |
13 | 762b9457cc2 |
14 | 37c87bdabdb |
15 | 1bc434aad58 |
hex | f00c94ac8d |
1031003221133 has 32 divisors (see below), whose sum is σ = 1056414078720. Its totient is φ = 1006042222080.
The previous prime is 1031003221121. The next prime is 1031003221147. The reversal of 1031003221133 is 3311223001301.
It is a cyclic number.
It is not a de Polignac number, because 1031003221133 - 216 = 1031003155597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031003221433) 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 31 ways as a sum of consecutive naturals, for example, 1274416433 + ... + 1274417241.
It is an arithmetic number, because the mean of its divisors is an integer number (33012939960).
Almost surely, 21031003221133 is an apocalyptic number.
It is an amenable number.
1031003221133 is a deficient number, since it is larger than the sum of its proper divisors (25410857587).
1031003221133 is a wasteful number, since it uses less digits than its factorization.
1031003221133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1637.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1031003221133 its reverse (3311223001301), we get a palindrome (4342226222434).
It can be divided in two parts, 103100 and 3221133, that added together give a palindrome (3324233).
The spelling of 1031003221133 in words is "one trillion, thirty-one billion, three million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •