Base | Representation |
---|---|
bin | 11100110000011… |
… | …00001000111000 |
3 | 121210220100122120 |
4 | 32120030020320 |
5 | 443223102300 |
6 | 35534121240 |
7 | 5656232502 |
oct | 1630141070 |
9 | 553810576 |
10 | 241222200 |
11 | 11418889a |
12 | 68950220 |
13 | 3ac8b23b |
14 | 24072d72 |
15 | 1629d3a0 |
hex | e60c238 |
241222200 has 48 divisors (see below), whose sum is σ = 747790680. Its totient is φ = 64325760.
The previous prime is 241222199. The next prime is 241222207. The reversal of 241222200 is 2222142.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 241222200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241222207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200419 + ... + 201618.
Almost surely, 2241222200 is an apocalyptic number.
241222200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
241222200 is an abundant number, since it is smaller than the sum of its proper divisors (506568480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241222200 is a wasteful number, since it uses less digits than its factorization.
241222200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402056 (or 402047 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
The square root of 241222200 is about 15531.3296275625. The cubic root of 241222200 is about 622.4996209736.
Adding to 241222200 its reverse (2222142), we get a palindrome (243444342).
The spelling of 241222200 in words is "two hundred forty-one million, two hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •