Base | Representation |
---|---|
bin | 11101110101100001001100… |
… | …011000111011010100100101 |
3 | 122012121121122122022000211120 |
4 | 131311201030120323110211 |
5 | 114144411324320231440 |
6 | 1143030052413324153 |
7 | 36432261512125011 |
oct | 3565411430732445 |
9 | 565547578260746 |
10 | 131221122430245 |
11 | 388a1624758841 |
12 | 12873648496659 |
13 | 582b138c4cb13 |
14 | 24591c9aa9541 |
15 | 1028568816dd0 |
hex | 77584c63b525 |
131221122430245 has 8 divisors (see below), whose sum is σ = 209953795888416. Its totient is φ = 69984598629456.
The previous prime is 131221122430201. The next prime is 131221122430319. The reversal of 131221122430245 is 542034221122131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-131221122430245 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4374037414327 + ... + 4374037414356.
It is an arithmetic number, because the mean of its divisors is an integer number (26244224486052).
Almost surely, 2131221122430245 is an apocalyptic number.
131221122430245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131221122430245 is a deficient number, since it is larger than the sum of its proper divisors (78732673458171).
131221122430245 is an equidigital number, since it uses as much as digits as its factorization.
131221122430245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8748074828691.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 131221122430245 its reverse (542034221122131), we get a palindrome (673255343552376).
The spelling of 131221122430245 in words is "one hundred thirty-one trillion, two hundred twenty-one billion, one hundred twenty-two million, four hundred thirty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •