Base | Representation |
---|---|
bin | 110110101010111000001000… |
… | …011001101111101000011101 |
3 | 1011112022221020201002220022211 |
4 | 312222320020121233220131 |
5 | 223003341132013143401 |
6 | 2211213023125040421 |
7 | 101434201061551300 |
oct | 6652701031575035 |
9 | 1145287221086284 |
10 | 240441000131101 |
11 | 6a680501321090 |
12 | 22b730b0556111 |
13 | a4216484cbc83 |
14 | 4353599612b37 |
15 | 1cbe64ed96951 |
hex | daae0866fa1d |
240441000131101 has 12 divisors (see below), whose sum is σ = 305123643951840. Its totient is φ = 187356623478360.
The previous prime is 240441000131083. The next prime is 240441000131141. The reversal of 240441000131101 is 101131000144042.
It is not a de Polignac number, because 240441000131101 - 27 = 240441000130973 is a prime.
It is a super-2 number, since 2×2404410001311012 (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 (240441000131141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 223043598841 + ... + 223043599918.
It is an arithmetic number, because the mean of its divisors is an integer number (25426970329320).
Almost surely, 2240441000131101 is an apocalyptic number.
It is an amenable number.
240441000131101 is a deficient number, since it is larger than the sum of its proper divisors (64682643820739).
240441000131101 is a wasteful number, since it uses less digits than its factorization.
240441000131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446087198784 (or 446087198777 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 240441000131101 its reverse (101131000144042), we get a palindrome (341572000275143).
The spelling of 240441000131101 in words is "two hundred forty trillion, four hundred forty-one billion, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •