Base | Representation |
---|---|
bin | 11101111000011101100111… |
… | …001100000011000110110101 |
3 | 122020022221212012000221021102 |
4 | 131320131213030003012311 |
5 | 114211220143442031010 |
6 | 1143303032012455445 |
7 | 36453013150635323 |
oct | 3570354714030665 |
9 | 566287765027242 |
10 | 131423435502005 |
11 | 3896a403158a99 |
12 | 128a68aa77a585 |
13 | 584423b53cbba |
14 | 2464cdd05cd13 |
15 | 102d959d90ba5 |
hex | 7787673031b5 |
131423435502005 has 16 divisors (see below), whose sum is σ = 162828456920064. Its totient is φ = 101726566170240.
The previous prime is 131423435502001. The next prime is 131423435502041. The reversal of 131423435502005 is 500205534324131.
It is not a de Polignac number, because 131423435502005 - 22 = 131423435502001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131423435502005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131423435502001) 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, 85106057 + ... + 86636526.
It is an arithmetic number, because the mean of its divisors is an integer number (10176778557504).
Almost surely, 2131423435502005 is an apocalyptic number.
It is an amenable number.
131423435502005 is a deficient number, since it is larger than the sum of its proper divisors (31405021418059).
131423435502005 is a wasteful number, since it uses less digits than its factorization.
131423435502005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171747556.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 131423435502005 its reverse (500205534324131), we get a palindrome (631628969826136).
The spelling of 131423435502005 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, four hundred thirty-five million, five hundred two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •