Base | Representation |
---|---|
bin | 1110001100011100110100… |
… | …00111100000101011000011 |
3 | 11002112001002012111120002010 |
4 | 13012032122013200223003 |
5 | 13042403000412001011 |
6 | 150215322054224003 |
7 | 6401100550536225 |
oct | 706163207405303 |
9 | 132461065446063 |
10 | 31214113000131 |
11 | 9a44916047016 |
12 | 3601607355003 |
13 | 145562a87b8b9 |
14 | 79cab1da4415 |
15 | 391e3d9b91a6 |
hex | 1c639a1e0ac3 |
31214113000131 has 16 divisors (see below), whose sum is σ = 41688106976768. Its totient is φ = 20774773404000.
The previous prime is 31214113000117. The next prime is 31214113000183. The reversal of 31214113000131 is 13100031141213.
It is not a de Polignac number, because 31214113000131 - 210 = 31214112999107 is a prime.
It is a super-2 number, since 2×312141130001312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31214113000098 and 31214113000107.
It is not an unprimeable number, because it can be changed into a prime (31214113008131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11910456 + ... + 14292906.
It is an arithmetic number, because the mean of its divisors is an integer number (2605506686048).
Almost surely, 231214113000131 is an apocalyptic number.
31214113000131 is a deficient number, since it is larger than the sum of its proper divisors (10473993976637).
31214113000131 is a wasteful number, since it uses less digits than its factorization.
31214113000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2389722.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 31214113000131 its reverse (13100031141213), we get a palindrome (44314144141344).
The spelling of 31214113000131 in words is "thirty-one trillion, two hundred fourteen billion, one hundred thirteen million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •