Base | Representation |
---|---|
bin | 1110000110000010111… |
… | …0100111100101111110 |
3 | 212011000020000101202100 |
4 | 3201200232213211332 |
5 | 12431401044031420 |
6 | 303123230005530 |
7 | 23331323362320 |
oct | 3414056474576 |
9 | 764006011670 |
10 | 242141002110 |
11 | 93767312877 |
12 | 3ab186468a6 |
13 | 19aabb17297 |
14 | ba10b6d610 |
15 | 6472dc2190 |
hex | 3860ba797e |
242141002110 has 192 divisors, whose sum is σ = 722819635200. Its totient is φ = 55092220416.
The previous prime is 242141002091. The next prime is 242141002193. The reversal of 242141002110 is 11200141242.
242141002110 is a `hidden beast` number, since 2 + 42 + 1 + 410 + 0 + 211 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 185264077 + ... + 185265383.
It is an arithmetic number, because the mean of its divisors is an integer number (3764685600).
Almost surely, 2242141002110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 242141002110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (361409817600).
242141002110 is an abundant number, since it is smaller than the sum of its proper divisors (480678633090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242141002110 is a wasteful number, since it uses less digits than its factorization.
242141002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2455 (or 2452 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 242141002110 its reverse (11200141242), we get a palindrome (253341143352).
The spelling of 242141002110 in words is "two hundred forty-two billion, one hundred forty-one million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •