Base | Representation |
---|---|
bin | 11111001100111000111… |
… | …100011010000111110010 |
3 | 21120222102002021210111022 |
4 | 133030320330122013302 |
5 | 240112201333243214 |
6 | 4321001200015442 |
7 | 310623613426634 |
oct | 37147074320762 |
9 | 7528362253438 |
10 | 2144144040434 |
11 | 75736545a930 |
12 | 2a7671601582 |
13 | 12726583b1a6 |
14 | 75ac4608a54 |
15 | 3ab92927d8e |
hex | 1f338f1a1f2 |
2144144040434 has 8 divisors (see below), whose sum is σ = 3508599338928. Its totient is φ = 974610927460.
The previous prime is 2144144040421. The next prime is 2144144040439. The reversal of 2144144040434 is 4340404414412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×21441440404342 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2144144040394 and 2144144040403.
It is not an unprimeable number, because it can be changed into a prime (2144144040439) 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 3 ways as a sum of consecutive naturals, for example, 48730546352 + ... + 48730546395.
It is an arithmetic number, because the mean of its divisors is an integer number (438574917366).
Almost surely, 22144144040434 is an apocalyptic number.
2144144040434 is a deficient number, since it is larger than the sum of its proper divisors (1364455298494).
2144144040434 is a wasteful number, since it uses less digits than its factorization.
2144144040434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97461092760.
The product of its (nonzero) digits is 98304, while the sum is 35.
Adding to 2144144040434 its reverse (4340404414412), we get a palindrome (6484548454846).
The spelling of 2144144040434 in words is "two trillion, one hundred forty-four billion, one hundred forty-four million, forty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •