Base | Representation |
---|---|
bin | 110111000111101110010000… |
… | …000000000000000000000000 |
3 | 1011210100102210110101001120221 |
4 | 313013232100000000000000 |
5 | 223233330311240212412 |
6 | 2215331412250312424 |
7 | 102030334152155335 |
oct | 6707562000000000 |
9 | 1153312713331527 |
10 | 242423255007232 |
11 | 70275141543742 |
12 | 23233301728714 |
13 | a536551591a40 |
14 | 43c14c346098c |
15 | 1d05eba064b07 |
hex | dc7b90000000 |
242423255007232 has 232 divisors, whose sum is σ = 527215824536576. Its totient is φ = 110803713785856.
The previous prime is 242423255007211. The next prime is 242423255007233. The reversal of 242423255007232 is 232700552324242.
It is not an unprimeable number, because it can be changed into a prime (242423255007233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 443186937583 + ... + 443186938129.
Almost surely, 2242423255007232 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 242423255007232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (263607912268288).
242423255007232 is an abundant number, since it is smaller than the sum of its proper divisors (284792569529344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242423255007232 is an frugal number, since it uses more digits than its factorization.
242423255007232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743 (or 689 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 43.
The spelling of 242423255007232 in words is "two hundred forty-two trillion, four hundred twenty-three billion, two hundred fifty-five million, seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •