Base | Representation |
---|---|
bin | 11101011101001110010… |
… | …011001010010010010101 |
3 | 21011111220222210011010212 |
4 | 131131032103022102111 |
5 | 231131122232222013 |
6 | 4145531405455205 |
7 | 266150430443210 |
oct | 35351623122225 |
9 | 7144828704125 |
10 | 2024243242133 |
11 | 7105275a1492 |
12 | 28838ab71505 |
13 | 118b68078168 |
14 | 6dd8c526777 |
15 | 379c651a6a8 |
hex | 1d74e4ca495 |
2024243242133 has 32 divisors (see below), whose sum is σ = 2460360714240. Its totient is φ = 1626769293120.
The previous prime is 2024243242127. The next prime is 2024243242163. The reversal of 2024243242133 is 3312423424202.
It is not a de Polignac number, because 2024243242133 - 232 = 2019948274837 is a prime.
It is a super-2 number, since 2×20242432421332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2024243242133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2024243242163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22242863 + ... + 22333683.
It is an arithmetic number, because the mean of its divisors is an integer number (76886272320).
Almost surely, 22024243242133 is an apocalyptic number.
It is an amenable number.
2024243242133 is a deficient number, since it is larger than the sum of its proper divisors (436117472107).
2024243242133 is a wasteful number, since it uses less digits than its factorization.
2024243242133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92577.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 2024243242133 its reverse (3312423424202), we get a palindrome (5336666666335).
The spelling of 2024243242133 in words is "two trillion, twenty-four billion, two hundred forty-three million, two hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •