Base | Representation |
---|---|
bin | 10010011001010010110100… |
… | …01001101001101010111110 |
3 | 12022020010102121001202112022 |
4 | 21030221122021221222332 |
5 | 20300224200201120100 |
6 | 222011100314240142 |
7 | 11343345144535064 |
oct | 1114513211515276 |
9 | 168203377052468 |
10 | 40451514473150 |
11 | 11986433395620 |
12 | 4653936426052 |
13 | 197573b664681 |
14 | 9dbc1419c034 |
15 | 4a2383e12e85 |
hex | 24ca5a269abe |
40451514473150 has 96 divisors (see below), whose sum is σ = 87017470525440. Its totient is φ = 13850403408000.
The previous prime is 40451514473141. The next prime is 40451514473179. The reversal of 40451514473150 is 5137441515404.
40451514473150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31430270 + ... + 32691969.
It is an arithmetic number, because the mean of its divisors is an integer number (906431984640).
Almost surely, 240451514473150 is an apocalyptic number.
40451514473150 is an abundant number, since it is smaller than the sum of its proper divisors (46565956052290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40451514473150 is a wasteful number, since it uses less digits than its factorization.
40451514473150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64122330 (or 64122325 counting only the distinct ones).
The product of its (nonzero) digits is 672000, while the sum is 44.
Adding to 40451514473150 its reverse (5137441515404), we get a palindrome (45588955988554).
The spelling of 40451514473150 in words is "forty trillion, four hundred fifty-one billion, five hundred fourteen million, four hundred seventy-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •