Base | Representation |
---|---|
bin | 11101110100010111100111… |
… | …011110101010100100000001 |
3 | 122012100001201211022222122100 |
4 | 131310113213132222210001 |
5 | 114142113030211234241 |
6 | 1142525505213501013 |
7 | 36423463662553650 |
oct | 3564274736524401 |
9 | 565301654288570 |
10 | 131142120024321 |
11 | 3887107398197a |
12 | 1286027a7a1769 |
13 | 58238586c2073 |
14 | 2455453613197 |
15 | 1026492c019b6 |
hex | 7745e77aa901 |
131142120024321 has 12 divisors (see below), whose sum is σ = 216488579087872. Its totient is φ = 74938354299576.
The previous prime is 131142120024317. The next prime is 131142120024347. The reversal of 131142120024321 is 123420021241131.
131142120024321 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 4 + 21 + 200 + 2 + 432 + 1 = 666.
It is not a de Polignac number, because 131142120024321 - 22 = 131142120024317 is a prime.
It is a super-2 number, since 2×1311421200243212 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131142120224321) 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, 1040810476321 + ... + 1040810476446.
Almost surely, 2131142120024321 is an apocalyptic number.
It is an amenable number.
131142120024321 is a deficient number, since it is larger than the sum of its proper divisors (85346459063551).
131142120024321 is a wasteful number, since it uses less digits than its factorization.
131142120024321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2081620952780 (or 2081620952777 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 131142120024321 its reverse (123420021241131), we get a palindrome (254562141265452).
The spelling of 131142120024321 in words is "one hundred thirty-one trillion, one hundred forty-two billion, one hundred twenty million, twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •