Base | Representation |
---|---|
bin | 11101111000001001110111… |
… | …111101010101111111111101 |
3 | 122020020221011011202200012011 |
4 | 131320021313331111333331 |
5 | 114210343242424222141 |
6 | 1143245205011011221 |
7 | 36451333024224115 |
oct | 3570116775257775 |
9 | 566227134680164 |
10 | 131402242023421 |
11 | 38961417a77936 |
12 | 128a2774b99b11 |
13 | 5842241815225 |
14 | 2463c8c464045 |
15 | 102d119476881 |
hex | 778277f55ffd |
131402242023421 has 8 divisors (see below), whose sum is σ = 131902338395520. Its totient is φ = 130902149197872.
The previous prime is 131402242023331. The next prime is 131402242023431. The reversal of 131402242023421 is 124320242204131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131402242023421 - 241 = 129203218767869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131402242023431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91725576 + ... + 93147118.
It is an arithmetic number, because the mean of its divisors is an integer number (16487792299440).
Almost surely, 2131402242023421 is an apocalyptic number.
It is an amenable number.
131402242023421 is a deficient number, since it is larger than the sum of its proper divisors (500096372099).
131402242023421 is a wasteful number, since it uses less digits than its factorization.
131402242023421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773275.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 131402242023421 its reverse (124320242204131), we get a palindrome (255722484227552).
The spelling of 131402242023421 in words is "one hundred thirty-one trillion, four hundred two billion, two hundred forty-two million, twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •