Base | Representation |
---|---|
bin | 1011111011001111001000… |
… | …0011100010011011101011 |
3 | 1201102112010211000122011002 |
4 | 2332303302003202123223 |
5 | 3204312443101414011 |
6 | 43515412533025215 |
7 | 2522222022145136 |
oct | 276636203423353 |
9 | 51375124018132 |
10 | 13112301201131 |
11 | 41a5994211320 |
12 | 157930318520b |
13 | 74163bb5b0a2 |
14 | 3348d2aab21d |
15 | 17b1337dbc3b |
hex | becf20e26eb |
13112301201131 has 32 divisors (see below), whose sum is σ = 15717543782400. Its totient is φ = 10805810400000.
The previous prime is 13112301201071. The next prime is 13112301201199. The reversal of 13112301201131 is 13110210321131.
It is not a de Polignac number, because 13112301201131 - 226 = 13112234092267 is a prime.
It is a super-2 number, since 2×131123012011312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13112301201031) 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, 10793120 + ... + 11946381.
It is an arithmetic number, because the mean of its divisors is an integer number (491173243200).
Almost surely, 213112301201131 is an apocalyptic number.
13112301201131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13112301201131 is a deficient number, since it is larger than the sum of its proper divisors (2605242581269).
13112301201131 is a wasteful number, since it uses less digits than its factorization.
13112301201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22739651.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13112301201131 its reverse (13110210321131), we get a palindrome (26222511522262).
The spelling of 13112301201131 in words is "thirteen trillion, one hundred twelve billion, three hundred one million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •