Base | Representation |
---|---|
bin | 11100110001011… |
… | …01110100011000 |
3 | 121211011100212220 |
4 | 32120231310120 |
5 | 443242011102 |
6 | 35541104040 |
7 | 5660345625 |
oct | 1630556430 |
9 | 554140786 |
10 | 241360152 |
11 | 114272500 |
12 | 689b8020 |
13 | 3b008c77 |
14 | 240ab34c |
15 | 162c91bc |
hex | e62dd18 |
241360152 has 96 divisors (see below), whose sum is σ = 702399600. Its totient is φ = 68823040.
The previous prime is 241360129. The next prime is 241360187. The reversal of 241360152 is 251063142.
241360152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 46924 + ... + 51812.
Almost surely, 2241360152 is an apocalyptic number.
241360152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 241360152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (351199800).
241360152 is an abundant number, since it is smaller than the sum of its proper divisors (461039448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241360152 is a wasteful number, since it uses less digits than its factorization.
241360152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4937 (or 4922 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 241360152 is about 15535.7700806880. The cubic root of 241360152 is about 622.6182649771.
The spelling of 241360152 in words is "two hundred forty-one million, three hundred sixty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •