Base | Representation |
---|---|
bin | 110110110110001111110010… |
… | …110000110010011011111110 |
3 | 1011122002121222022101121120100 |
4 | 312312033302300302123332 |
5 | 223104141303201333042 |
6 | 2213012000545301530 |
7 | 101544510663441063 |
oct | 6666176260623376 |
9 | 1148077868347510 |
10 | 241222321121022 |
11 | 6a9518a269006a |
12 | 2307a6033348a6 |
13 | a47a223677857 |
14 | 437d318cb8c6a |
15 | 1cd4b2d3a724c |
hex | db63f2c326fe |
241222321121022 has 48 divisors (see below), whose sum is σ = 524704473596160. Its totient is φ = 80091244562496.
The previous prime is 241222321120999. The next prime is 241222321121071. The reversal of 241222321121022 is 220121123222142.
241222321121022 is a `hidden beast` number, since 2 + 4 + 1 + 222 + 321 + 12 + 102 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17080483 + ... + 27824225.
It is an arithmetic number, because the mean of its divisors is an integer number (10931343199920).
Almost surely, 2241222321121022 is an apocalyptic number.
241222321121022 is an abundant number, since it is smaller than the sum of its proper divisors (283482152475138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241222321121022 is a wasteful number, since it uses less digits than its factorization.
241222321121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10748657 (or 10748654 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 241222321121022 its reverse (220121123222142), we get a palindrome (461343444343164).
The spelling of 241222321121022 in words is "two hundred forty-one trillion, two hundred twenty-two billion, three hundred twenty-one million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •