Base | Representation |
---|---|
bin | 11101100011100111101… |
… | …101100000011110110101 |
3 | 21012011122200121201220102 |
4 | 131203213231200132311 |
5 | 231234204134431013 |
6 | 4153025135443445 |
7 | 266512564253204 |
oct | 35434755403665 |
9 | 7164580551812 |
10 | 2031112030133 |
11 | 71343187658a |
12 | 289787386585 |
13 | 1196c112ca64 |
14 | 7044088923b |
15 | 37c79566d58 |
hex | 1d8e7b607b5 |
2031112030133 has 4 divisors (see below), whose sum is σ = 2031500170668. Its totient is φ = 2030723889600.
The previous prime is 2031112030093. The next prime is 2031112030153. The reversal of 2031112030133 is 3310302111302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1210752516964 + 820359513169 = 1100342^2 + 905737^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031112030133 - 26 = 2031112030069 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 (2031112030153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 194062418 + ... + 194072883.
It is an arithmetic number, because the mean of its divisors is an integer number (507875042667).
Almost surely, 22031112030133 is an apocalyptic number.
It is an amenable number.
2031112030133 is a deficient number, since it is larger than the sum of its proper divisors (388140535).
2031112030133 is an equidigital number, since it uses as much as digits as its factorization.
2031112030133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388140534.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 2031112030133 its reverse (3310302111302), we get a palindrome (5341414141435).
The spelling of 2031112030133 in words is "two trillion, thirty-one billion, one hundred twelve million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •