Base | Representation |
---|---|
bin | 1110000110100001000000… |
… | …01001000011100110110111 |
3 | 11001210112202101002111020101 |
4 | 13003100200021003212313 |
5 | 13031032343444401403 |
6 | 145541520214014531 |
7 | 6350261512300012 |
oct | 703204011034667 |
9 | 131715671074211 |
10 | 31010203122103 |
11 | 9976398256667 |
12 | 3589b9a347447 |
13 | 143c33250363a |
14 | 792c8a90c379 |
15 | 38b9a717271d |
hex | 1c34202439b7 |
31010203122103 has 4 divisors (see below), whose sum is σ = 32358472823088. Its totient is φ = 29661933421120.
The previous prime is 31010203122053. The next prime is 31010203122113. The reversal of 31010203122103 is 30122130201013.
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-31010203122103 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 (31010203122113) 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, 674134850458 + ... + 674134850503.
It is an arithmetic number, because the mean of its divisors is an integer number (8089618205772).
Almost surely, 231010203122103 is an apocalyptic number.
31010203122103 is a deficient number, since it is larger than the sum of its proper divisors (1348269700985).
31010203122103 is a wasteful number, since it uses less digits than its factorization.
31010203122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1348269700984.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 31010203122103 its reverse (30122130201013), we get a palindrome (61132333323116).
The spelling of 31010203122103 in words is "thirty-one trillion, ten billion, two hundred three million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •