Base | Representation |
---|---|
bin | 11101111000001010000010… |
… | …000110010011001001110101 |
3 | 122020020221121000212122200111 |
4 | 131320022002012103021311 |
5 | 114210344120002040341 |
6 | 1143245233525143021 |
7 | 36451340161222162 |
oct | 3570120206231165 |
9 | 566227530778614 |
10 | 131402412143221 |
11 | 389614a500140a |
12 | 128a2801b5aa71 |
13 | 584226ab39c2b |
14 | 2463ca6ca9069 |
15 | 102d12937c681 |
hex | 778282193275 |
131402412143221 has 16 divisors (see below), whose sum is σ = 139013094850560. Its totient is φ = 124041260032560.
The previous prime is 131402412143201. The next prime is 131402412143231. The reversal of 131402412143221 is 122341214204131.
It is a cyclic number.
It is not a de Polignac number, because 131402412143221 - 211 = 131402412141173 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131402412143201) 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, 323022865 + ... + 323429398.
It is an arithmetic number, because the mean of its divisors is an integer number (8688318428160).
Almost surely, 2131402412143221 is an apocalyptic number.
It is an amenable number.
131402412143221 is a deficient number, since it is larger than the sum of its proper divisors (7610682707339).
131402412143221 is an equidigital number, since it uses as much as digits as its factorization.
131402412143221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646452456.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 131402412143221 its reverse (122341214204131), we get a palindrome (253743626347352).
The spelling of 131402412143221 in words is "one hundred thirty-one trillion, four hundred two billion, four hundred twelve million, one hundred forty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •