Base | Representation |
---|---|
bin | 101101101101011000101101… |
… | …010110011101111111010111 |
3 | 222100210101011001020210221022 |
4 | 231231120231112131333113 |
5 | 202322142442012340203 |
6 | 1551320211100111355 |
7 | 60226003405620122 |
oct | 5555305526357727 |
9 | 870711131223838 |
10 | 201031000121303 |
11 | 5906684a779200 |
12 | 1a6691a323555b |
13 | 88231acb9cc61 |
14 | 378dd492553b9 |
15 | 1839427136a38 |
hex | b6d62d59dfd7 |
201031000121303 has 12 divisors (see below), whose sum is σ = 224590384373544. Its totient is φ = 179759463589200.
The previous prime is 201031000121227. The next prime is 201031000121327. The reversal of 201031000121303 is 303121000130102.
It is a de Polignac number, because none of the positive numbers 2k-201031000121303 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 (201031000121333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13618133801 + ... + 13618148562.
It is an arithmetic number, because the mean of its divisors is an integer number (18715865364462).
Almost surely, 2201031000121303 is an apocalyptic number.
201031000121303 is a deficient number, since it is larger than the sum of its proper divisors (23559384252241).
201031000121303 is a wasteful number, since it uses less digits than its factorization.
201031000121303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27236282446 (or 27236282435 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201031000121303 its reverse (303121000130102), we get a palindrome (504152000251405).
The spelling of 201031000121303 in words is "two hundred one trillion, thirty-one billion, one hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •