Base | Representation |
---|---|
bin | 11101101111101010100… |
… | …001000110101001101101 |
3 | 21020102000221102111020000 |
4 | 131233222201012221231 |
5 | 231442200231342031 |
6 | 4203004301014513 |
7 | 300451213300515 |
oct | 35575241065155 |
9 | 7212027374200 |
10 | 2044044012141 |
11 | 71896861401a |
12 | 290196254439 |
13 | 11a9a23a8111 |
14 | 70d0a18a845 |
15 | 38284a303e6 |
hex | 1dbea846a6d |
2044044012141 has 20 divisors (see below), whose sum is σ = 3053504796672. Its totient is φ = 1362670867368.
The previous prime is 2044044012133. The next prime is 2044044012187. The reversal of 2044044012141 is 1412104404402.
It is a happy number.
2044044012141 is a `hidden beast` number, since 2 + 0 + 4 + 4 + 0 + 440 + 1 + 214 + 1 = 666.
It is not a de Polignac number, because 2044044012141 - 23 = 2044044012133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2044044012121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4871316 + ... + 5274258.
Almost surely, 22044044012141 is an apocalyptic number.
It is an amenable number.
2044044012141 is a deficient number, since it is larger than the sum of its proper divisors (1009460784531).
2044044012141 is an equidigital number, since it uses as much as digits as its factorization.
2044044012141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465582 (or 465573 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 27.
Adding to 2044044012141 its reverse (1412104404402), we get a palindrome (3456148416543).
The spelling of 2044044012141 in words is "two trillion, forty-four billion, forty-four million, twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •