Base | Representation |
---|---|
bin | 1110000101010111010… |
… | …1100010010111001010 |
3 | 212010112111011110100220 |
4 | 3201111311202113022 |
5 | 12431012304010224 |
6 | 303053141210510 |
7 | 23323644221022 |
oct | 3412565422712 |
9 | 763474143326 |
10 | 241958266314 |
11 | 93683151756 |
12 | 3aa87400a36 |
13 | 19a7ccc60ab |
14 | b9d47a2a82 |
15 | 6461d28279 |
hex | 3855d625ca |
241958266314 has 8 divisors (see below), whose sum is σ = 483916532640. Its totient is φ = 80652755436.
The previous prime is 241958266313. The next prime is 241958266337. The reversal of 241958266314 is 413662859142.
It is a happy number.
241958266314 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
241958266314 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (241958266313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20163188854 + ... + 20163188865.
It is an arithmetic number, because the mean of its divisors is an integer number (60489566580).
Almost surely, 2241958266314 is an apocalyptic number.
241958266314 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.
241958266314 is a wasteful number, since it uses less digits than its factorization.
241958266314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40326377724.
The product of its digits is 2488320, while the sum is 51.
The spelling of 241958266314 in words is "two hundred forty-one billion, nine hundred fifty-eight million, two hundred sixty-six thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •