Base | Representation |
---|---|
bin | 1110001001001000100000… |
… | …11001001001111100000111 |
3 | 11002010010212202102210211202 |
4 | 13010210100121021330013 |
5 | 13034021033101020403 |
6 | 150051112020053115 |
7 | 6356624202435443 |
oct | 704442031117407 |
9 | 132103782383752 |
10 | 31100133220103 |
11 | 9a00546473302 |
12 | 35a34b783419b |
13 | 14479649bc88c |
14 | 79737c411823 |
15 | 38debc2e2688 |
hex | 1c4910649f07 |
31100133220103 has 8 divisors (see below), whose sum is σ = 31306269271680. Its totient is φ = 30893999470200.
The previous prime is 31100133220097. The next prime is 31100133220147. The reversal of 31100133220103 is 30102233100113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31100133220103 - 220 = 31100132171527 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 (31100133220703) 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 7 ways as a sum of consecutive naturals, for example, 33013268 + ... + 33942246.
It is an arithmetic number, because the mean of its divisors is an integer number (3913283658960).
Almost surely, 231100133220103 is an apocalyptic number.
31100133220103 is a deficient number, since it is larger than the sum of its proper divisors (206136051577).
31100133220103 is a wasteful number, since it uses less digits than its factorization.
31100133220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150837.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31100133220103 its reverse (30102233100113), we get a palindrome (61202366320216).
The spelling of 31100133220103 in words is "thirty-one trillion, one hundred billion, one hundred thirty-three million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •