Base | Representation |
---|---|
bin | 1110001101010100111000… |
… | …00111001100110010110101 |
3 | 11002121220202210122202222221 |
4 | 13012222130013030302311 |
5 | 13043401121034303323 |
6 | 150241220440122341 |
7 | 6403214452435042 |
oct | 706523407146265 |
9 | 132556683582887 |
10 | 31244211244213 |
11 | 9a56660792300 |
12 | 36074071663b1 |
13 | 14584163c1196 |
14 | 7a03294a41c9 |
15 | 392b0104c55d |
hex | 1c6a9c1cccb5 |
31244211244213 has 12 divisors (see below), whose sum is σ = 34342962522624. Its totient is φ = 28403702841800.
The previous prime is 31244211244171. The next prime is 31244211244291.
31244211244213 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31244211244213 - 221 = 31244209147061 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 (31244211247213) 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 11 ways as a sum of consecutive naturals, for example, 37201548 + ... + 38032138.
It is an arithmetic number, because the mean of its divisors is an integer number (2861913543552).
Almost surely, 231244211244213 is an apocalyptic number.
It is an amenable number.
31244211244213 is a deficient number, since it is larger than the sum of its proper divisors (3098751278411).
31244211244213 is a wasteful number, since it uses less digits than its factorization.
31244211244213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1141496 (or 1141485 counting only the distinct ones).
The product of its digits is 36864, while the sum is 34.
It can be divided in two parts, 3124421 and 1244213, that added together give a palindrome (4368634).
The spelling of 31244211244213 in words is "thirty-one trillion, two hundred forty-four billion, two hundred eleven million, two hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •