Base | Representation |
---|---|
bin | 110001010110101110001110… |
… | …1111111001101100010000110 |
3 | 2002221010120021211122202220201 |
4 | 1202231130131333031202012 |
5 | 423400302304110002100 |
6 | 4135153131533321114 |
7 | 160304652223435561 |
oct | 14255343577154206 |
9 | 2087116254582821 |
10 | 434131502422150 |
11 | 116367155372445 |
12 | 4083571593619a |
13 | 1583156a9b9b30 |
14 | 792c110b734d8 |
15 | 352cb53a9d36a |
hex | 18ad71dfcd886 |
434131502422150 has 48 divisors (see below), whose sum is σ = 878208683265648. Its totient is φ = 158707632240000.
The previous prime is 434131502422141. The next prime is 434131502422157. The reversal of 434131502422150 is 51224205131434.
It is a super-2 number, since 2×4341315024221502 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434131502422157) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3306343356 + ... + 3306474655.
It is an arithmetic number, because the mean of its divisors is an integer number (18296014234701).
Almost surely, 2434131502422150 is an apocalyptic number.
434131502422150 is an abundant number, since it is smaller than the sum of its proper divisors (444077180843498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
434131502422150 is a wasteful number, since it uses less digits than its factorization.
434131502422150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6612818137 (or 6612818132 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 434131502422150 its reverse (51224205131434), we get a palindrome (485355707553584).
The spelling of 434131502422150 in words is "four hundred thirty-four trillion, one hundred thirty-one billion, five hundred two million, four hundred twenty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •