Base | Representation |
---|---|
bin | 11101110010011110101000… |
… | …111101111000001111011001 |
3 | 122011212122110000200222200200 |
4 | 131302132220331320033121 |
5 | 114133001012342121241 |
6 | 1142350103425052413 |
7 | 36411214666510605 |
oct | 3562365075701731 |
9 | 564778400628620 |
10 | 131012222223321 |
11 | 38820a75a6642a |
12 | 1283b068187109 |
13 | 5814526a50c1a |
14 | 244d04d94c505 |
15 | 1022dddd294b6 |
hex | 7727a8f783d9 |
131012222223321 has 48 divisors (see below), whose sum is σ = 197798897552256. Its totient is φ = 83403954805248.
The previous prime is 131012222223299. The next prime is 131012222223409. The reversal of 131012222223321 is 123322222210131.
131012222223321 is a `hidden beast` number, since 1 + 3 + 101 + 2 + 2 + 2 + 222 + 332 + 1 = 666.
It is not a de Polignac number, because 131012222223321 - 217 = 131012222092249 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131012222423321) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 680936091 + ... + 681128463.
It is an arithmetic number, because the mean of its divisors is an integer number (4120810365672).
Almost surely, 2131012222223321 is an apocalyptic number.
It is an amenable number.
131012222223321 is a deficient number, since it is larger than the sum of its proper divisors (66786675328935).
131012222223321 is a wasteful number, since it uses less digits than its factorization.
131012222223321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197902 (or 197899 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 131012222223321 its reverse (123322222210131), we get a palindrome (254334444433452).
The spelling of 131012222223321 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-two million, two hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •