Base | Representation |
---|---|
bin | 10011001001100100001100… |
… | …01101110000001011001100 |
3 | 12112002200120001021102112212 |
4 | 21210302012031300023030 |
5 | 21004413001421401444 |
6 | 225321041252445552 |
7 | 11604232544456333 |
oct | 1144620615601314 |
9 | 175080501242485 |
10 | 42110111122124 |
11 | 12465885a13731 |
12 | 488127b0198b8 |
13 | 1a65c74364a66 |
14 | a581d6bd6d1a |
15 | 4d05a994219e |
hex | 264c863702cc |
42110111122124 has 24 divisors (see below), whose sum is σ = 73730043940896. Its totient is φ = 21044385072000.
The previous prime is 42110111122117. The next prime is 42110111122139. The reversal of 42110111122124 is 42122111101124.
It is a super-2 number, since 2×421101111221242 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42110111122124.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254019584 + ... + 254185304.
It is an arithmetic number, because the mean of its divisors is an integer number (3072085164204).
Almost surely, 242110111122124 is an apocalyptic number.
It is an amenable number.
42110111122124 is a deficient number, since it is larger than the sum of its proper divisors (31619932818772).
42110111122124 is a wasteful number, since it uses less digits than its factorization.
42110111122124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197537 (or 197535 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 42110111122124 its reverse (42122111101124), we get a palindrome (84232222223248).
The spelling of 42110111122124 in words is "forty-two trillion, one hundred ten billion, one hundred eleven million, one hundred twenty-two thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •