Base | Representation |
---|---|
bin | 1110001001011010001… |
… | …1110110110111000000 |
3 | 212020100011110002201212 |
4 | 3202112203312313000 |
5 | 12440223300310340 |
6 | 303353011345252 |
7 | 23362601123540 |
oct | 3422643666700 |
9 | 766304402655 |
10 | 243044150720 |
11 | 940900a5788 |
12 | 3b12abb2228 |
13 | 19bc3c73b47 |
14 | ba98aa9320 |
15 | 64c7321a65 |
hex | 38968f6dc0 |
243044150720 has 56 divisors (see below), whose sum is σ = 661427301984. Its totient is φ = 83329422336.
The previous prime is 243044150717. The next prime is 243044150761. The reversal of 243044150720 is 27051440342.
243044150720 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 54248687 + ... + 54253166.
Almost surely, 2243044150720 is an apocalyptic number.
243044150720 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
243044150720 is an abundant number, since it is smaller than the sum of its proper divisors (418383151264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243044150720 is a wasteful number, since it uses less digits than its factorization.
243044150720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108501877 (or 108501867 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 32.
The spelling of 243044150720 in words is "two hundred forty-three billion, forty-four million, one hundred fifty thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •