Base | Representation |
---|---|
bin | 11110110000111010110… |
… | …010100011100101110110 |
3 | 21111002212222101201012120 |
4 | 132300322302203211312 |
5 | 234114144210204032 |
6 | 4255113035300410 |
7 | 305511423356604 |
oct | 36607262434566 |
9 | 7432788351176 |
10 | 2114110241142 |
11 | 7456531309a9 |
12 | 2a188b2aa706 |
13 | 12448a470a13 |
14 | 744758c2874 |
15 | 39ed5d7462c |
hex | 1ec3aca3976 |
2114110241142 has 8 divisors (see below), whose sum is σ = 4228220482296. Its totient is φ = 704703413712.
The previous prime is 2114110241129. The next prime is 2114110241161. The reversal of 2114110241142 is 2411420114112.
It is a sphenic number, since it is the product of 3 distinct primes.
2114110241142 is an admirable number.
It is a super-2 number, since 2×21141102411422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 176175853423 + ... + 176175853434.
It is an arithmetic number, because the mean of its divisors is an integer number (528527560287).
Almost surely, 22114110241142 is an apocalyptic number.
2114110241142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2114110241142 is a wasteful number, since it uses less digits than its factorization.
2114110241142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352351706862.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 2114110241142 its reverse (2411420114112), we get a palindrome (4525530355254).
The spelling of 2114110241142 in words is "two trillion, one hundred fourteen billion, one hundred ten million, two hundred forty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •