Base | Representation |
---|---|
bin | 11101100011101101101… |
… | …111111100001101110001 |
3 | 21012011220202020100222222 |
4 | 131203231233330031301 |
5 | 231234411103100223 |
6 | 4153043155010425 |
7 | 266515234305005 |
oct | 35435557741561 |
9 | 7164822210888 |
10 | 2031213331313 |
11 | 713483a76671 |
12 | 2897b5299a15 |
13 | 11970910a89a |
14 | 704500d8705 |
15 | 37c833c70c8 |
hex | 1d8edbfc371 |
2031213331313 has 4 divisors (see below), whose sum is σ = 2044845635700. Its totient is φ = 2017581026928.
The previous prime is 2031213331309. The next prime is 2031213331349. The reversal of 2031213331313 is 3131333121302.
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 652956115249 + 1378257216064 = 808057^2 + 1173992^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031213331313 - 22 = 2031213331309 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2031213331373) 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, 6816151970 + ... + 6816152267.
It is an arithmetic number, because the mean of its divisors is an integer number (511211408925).
Almost surely, 22031213331313 is an apocalyptic number.
It is an amenable number.
2031213331313 is a deficient number, since it is larger than the sum of its proper divisors (13632304387).
2031213331313 is a wasteful number, since it uses less digits than its factorization.
2031213331313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13632304386.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 2031213331313 its reverse (3131333121302), we get a palindrome (5162546452615).
The spelling of 2031213331313 in words is "two trillion, thirty-one billion, two hundred thirteen million, three hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •