Base | Representation |
---|---|
bin | 1110001111000010100101… |
… | …11011111100111110100101 |
3 | 11002211112210202220010202111 |
4 | 13013201102323330332211 |
5 | 13100332233423214341 |
6 | 150324241315241021 |
7 | 6410401216112503 |
oct | 707412273747645 |
9 | 132745722803674 |
10 | 31303113101221 |
11 | 9a79637303275 |
12 | 36169052a9171 |
13 | 1460b4249aa00 |
14 | 7a311617d673 |
15 | 3943ec184681 |
hex | 1c7852efcfa5 |
31303113101221 has 12 divisors (see below), whose sum is σ = 34684555765728. Its totient is φ = 28223200356624.
The previous prime is 31303113101209. The next prime is 31303113101369. The reversal of 31303113101221 is 12210131130313.
It is not a de Polignac number, because 31303113101221 - 29 = 31303113100709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31303113101192 and 31303113101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31303113101201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2153777865 + ... + 2153792398.
It is an arithmetic number, because the mean of its divisors is an integer number (2890379647144).
Almost surely, 231303113101221 is an apocalyptic number.
It is an amenable number.
31303113101221 is a deficient number, since it is larger than the sum of its proper divisors (3381442664507).
31303113101221 is a wasteful number, since it uses less digits than its factorization.
31303113101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4307570332 (or 4307570319 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 31303113101221 its reverse (12210131130313), we get a palindrome (43513244231534).
The spelling of 31303113101221 in words is "thirty-one trillion, three hundred three billion, one hundred thirteen million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •