Base | Representation |
---|---|
bin | 11101100011110011101… |
… | …100001010011000111101 |
3 | 21012012011200210021100102 |
4 | 131203303230022120331 |
5 | 231240112112112333 |
6 | 4153101115210445 |
7 | 266520554435132 |
oct | 35436354123075 |
9 | 7165150707312 |
10 | 2031313004093 |
11 | 71352526426a |
12 | 289822746a25 |
13 | 119723968469 |
14 | 7045d442589 |
15 | 37c8c014ae8 |
hex | 1d8f3b0a63d |
2031313004093 has 8 divisors (see below), whose sum is σ = 2074570066560. Its totient is φ = 1988057509920.
The previous prime is 2031313004069. The next prime is 2031313004101. The reversal of 2031313004093 is 3904003131302.
It is a happy number.
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 2031313004093 - 224 = 2031296226877 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 (2031313004293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2441753 + ... + 3166193.
It is an arithmetic number, because the mean of its divisors is an integer number (259321258320).
Almost surely, 22031313004093 is an apocalyptic number.
It is an amenable number.
2031313004093 is a deficient number, since it is larger than the sum of its proper divisors (43257062467).
2031313004093 is an equidigital number, since it uses as much as digits as its factorization.
2031313004093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784147.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 2031313004093 its reverse (3904003131302), we get a palindrome (5935316135395).
The spelling of 2031313004093 in words is "two trillion, thirty-one billion, three hundred thirteen million, four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •