Base | Representation |
---|---|
bin | 110110111011000001010100… |
… | …001111100111011110001101 |
3 | 1011200020222201212221222120220 |
4 | 312323001110033213132031 |
5 | 223130030131232411041 |
6 | 2213422413203301553 |
7 | 101610303310012560 |
oct | 6673012417473615 |
9 | 1150228655858526 |
10 | 241550374107021 |
11 | 6aa68a35a83a11 |
12 | 231120b767a8b9 |
13 | a4a2144386755 |
14 | 4391159a404d7 |
15 | 1cdd42d796d66 |
hex | dbb0543e778d |
241550374107021 has 16 divisors (see below), whose sum is σ = 368080206476928. Its totient is φ = 138027492979200.
The previous prime is 241550374107011. The next prime is 241550374107043. The reversal of 241550374107021 is 120701473055142.
It is not a de Polignac number, because 241550374107021 - 246 = 171181629929357 is a prime.
It is a super-2 number, since 2×2415503741070212 (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 (241550374107011) 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, 51543900 + ... + 56034581.
It is an arithmetic number, because the mean of its divisors is an integer number (23005012904808).
Almost surely, 2241550374107021 is an apocalyptic number.
241550374107021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
241550374107021 is a deficient number, since it is larger than the sum of its proper divisors (126529832369907).
241550374107021 is a wasteful number, since it uses less digits than its factorization.
241550374107021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107685412.
The product of its (nonzero) digits is 235200, while the sum is 42.
The spelling of 241550374107021 in words is "two hundred forty-one trillion, five hundred fifty billion, three hundred seventy-four million, one hundred seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •