Base | Representation |
---|---|
bin | 1110000001110110000… |
… | …0011100110000011000 |
3 | 212001002121212211121221 |
4 | 3200131200130300120 |
5 | 12422043340323412 |
6 | 302415301341424 |
7 | 23261350343110 |
oct | 3403540346030 |
9 | 761077784557 |
10 | 241013214232 |
11 | 9323874907a |
12 | 3a862a07874 |
13 | 1995c28748b |
14 | b94507a040 |
15 | 6408d9cb07 |
hex | 381d81cc18 |
241013214232 has 64 divisors (see below), whose sum is σ = 548100544320. Its totient is φ = 96990732288.
The previous prime is 241013214217. The next prime is 241013214287. The reversal of 241013214232 is 232412310142.
It is a junction number, because it is equal to n+sod(n) for n = 241013214197 and 241013214206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119878 + ... + 704554.
It is an arithmetic number, because the mean of its divisors is an integer number (8564071005).
Almost surely, 2241013214232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 241013214232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274050272160).
241013214232 is an abundant number, since it is smaller than the sum of its proper divisors (307087330088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241013214232 is a wasteful number, since it uses less digits than its factorization.
241013214232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585140 (or 585136 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 241013214232 its reverse (232412310142), we get a palindrome (473425524374).
The spelling of 241013214232 in words is "two hundred forty-one billion, thirteen million, two hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •