Base | Representation |
---|---|
bin | 110111000100100111101010… |
… | …010000111100010010011000 |
3 | 1011202121001101211000211110220 |
4 | 313010213222100330102120 |
5 | 223221332110341024422 |
6 | 2215045425250240040 |
7 | 102006045054246366 |
oct | 6704475220742230 |
9 | 1152531354024426 |
10 | 242210021033112 |
11 | 701a276951a950 |
12 | 231b9b11b86020 |
13 | a51c3cb57ca62 |
14 | 43b505590a636 |
15 | 1d00689d72e5c |
hex | dc49ea43c498 |
242210021033112 has 64 divisors (see below), whose sum is σ = 695339773315200. Its totient is φ = 69533977328640.
The previous prime is 242210021033083. The next prime is 242210021033143. The reversal of 242210021033112 is 211330120012242.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24143737113 + ... + 24143747144.
It is an arithmetic number, because the mean of its divisors is an integer number (10864683958050).
Almost surely, 2242210021033112 is an apocalyptic number.
242210021033112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
242210021033112 is an abundant number, since it is smaller than the sum of its proper divisors (453129752282088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242210021033112 is a wasteful number, since it uses less digits than its factorization.
242210021033112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48287484296 (or 48287484292 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 242210021033112 its reverse (211330120012242), we get a palindrome (453540141045354).
The spelling of 242210021033112 in words is "two hundred forty-two trillion, two hundred ten billion, twenty-one million, thirty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •