Base | Representation |
---|---|
bin | 11101011101001101110… |
… | …000010101010010001101 |
3 | 21011111220100121022011000 |
4 | 131131031300111102031 |
5 | 231131112413042031 |
6 | 4145530442050513 |
7 | 266150260026153 |
oct | 35351560252215 |
9 | 7144810538130 |
10 | 2024234112141 |
11 | 710522425a3a |
12 | 288387aa9a39 |
13 | 118b661cc5b7 |
14 | 6dd8b22b3d3 |
15 | 379c58153e6 |
hex | 1d74dc1548d |
2024234112141 has 16 divisors (see below), whose sum is σ = 2999744147520. Its totient is φ = 1349093949840.
The previous prime is 2024234112137. The next prime is 2024234112143. The reversal of 2024234112141 is 1412114324202.
2024234112141 is a `hidden beast` number, since 2 + 0 + 242 + 3 + 411 + 2 + 1 + 4 + 1 = 666.
It is not a de Polignac number, because 2024234112141 - 22 = 2024234112137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2024234112143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10891095 + ... + 11075396.
It is an arithmetic number, because the mean of its divisors is an integer number (187484009220).
Almost surely, 22024234112141 is an apocalyptic number.
It is an amenable number.
2024234112141 is a deficient number, since it is larger than the sum of its proper divisors (975510035379).
2024234112141 is a wasteful number, since it uses less digits than its factorization.
2024234112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21969913 (or 21969907 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 2024234112141 its reverse (1412114324202), we get a palindrome (3436348436343).
The spelling of 2024234112141 in words is "two trillion, twenty-four billion, two hundred thirty-four million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •