Base | Representation |
---|---|
bin | 1001001001101100101010… |
… | …00011010001010001101101 |
3 | 2122020212122121020120000122 |
4 | 10210312111003101101231 |
5 | 10114204304121203031 |
6 | 110445010530534325 |
7 | 4144640643241301 |
oct | 444662503212155 |
9 | 78225577216018 |
10 | 20124422444141 |
11 | 64597a0910974 |
12 | 23102b84373a5 |
13 | b2c95678bb52 |
14 | 4d8054a81d01 |
15 | 24d73820a47b |
hex | 124d950d146d |
20124422444141 has 4 divisors (see below), whose sum is σ = 21183602572800. Its totient is φ = 19065242315484.
The previous prime is 20124422444123. The next prime is 20124422444213. The reversal of 20124422444141 is 14144422442102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20124422444141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20124422444941) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 529590064301 + ... + 529590064338.
It is an arithmetic number, because the mean of its divisors is an integer number (5295900643200).
Almost surely, 220124422444141 is an apocalyptic number.
It is an amenable number.
20124422444141 is a deficient number, since it is larger than the sum of its proper divisors (1059180128659).
20124422444141 is a wasteful number, since it uses less digits than its factorization.
20124422444141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1059180128658.
The product of its (nonzero) digits is 65536, while the sum is 35.
Adding to 20124422444141 its reverse (14144422442102), we get a palindrome (34268844886243).
The spelling of 20124422444141 in words is "twenty trillion, one hundred twenty-four billion, four hundred twenty-two million, four hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •