Base | Representation |
---|---|
bin | 1110001001011011011111… |
… | …01100101100101100101001 |
3 | 11002011010011211122012202020 |
4 | 13010231233230230230221 |
5 | 13034202414430111241 |
6 | 150055515031255053 |
7 | 6360434532545463 |
oct | 704555754545451 |
9 | 132133154565666 |
10 | 31110322113321 |
11 | 9a048a4874610 |
12 | 35a547bb1a489 |
13 | 14488c9875a89 |
14 | 797a676a5133 |
15 | 38e3b6a63b66 |
hex | 1c4b6fb2cb29 |
31110322113321 has 32 divisors (see below), whose sum is σ = 45702250638336. Its totient is φ = 18666900120000.
The previous prime is 31110322113281. The next prime is 31110322113401. The reversal of 31110322113321 is 12331122301113.
It is not a de Polignac number, because 31110322113321 - 229 = 31109785242409 is a prime.
It is a super-2 number, since 2×311103221133212 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31110322113291 and 31110322113300.
It is not an unprimeable number, because it can be changed into a prime (31110322112321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54936106 + ... + 55499516.
It is an arithmetic number, because the mean of its divisors is an integer number (1428195332448).
Almost surely, 231110322113321 is an apocalyptic number.
It is an amenable number.
31110322113321 is a deficient number, since it is larger than the sum of its proper divisors (14591928525015).
31110322113321 is a wasteful number, since it uses less digits than its factorization.
31110322113321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580093.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 31110322113321 its reverse (12331122301113), we get a palindrome (43441444414434).
The spelling of 31110322113321 in words is "thirty-one trillion, one hundred ten billion, three hundred twenty-two million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •