Base | Representation |
---|---|
bin | 110111010000001101111111… |
… | …111001000101111001000000 |
3 | 1011212102020210122022121220012 |
4 | 313100031333321011321000 |
5 | 223322412020140010102 |
6 | 2220455530513404052 |
7 | 102120453324323030 |
oct | 6720157771057100 |
9 | 1155366718277805 |
10 | 243007100313152 |
11 | 7047a806a4349a |
12 | 233084a2269628 |
13 | a5796183b2666 |
14 | 440186bdc58c0 |
15 | 1d1628ba31752 |
hex | dd037fe45e40 |
243007100313152 has 56 divisors (see below), whose sum is σ = 553576713048576. Its totient is φ = 103678878117888.
The previous prime is 243007100313143. The next prime is 243007100313161. The reversal of 243007100313152 is 251313001700342.
It is an interprime number because it is at equal distance from previous prime (243007100313143) and next prime (243007100313161).
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 an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1216103153 + ... + 1216302960.
It is an arithmetic number, because the mean of its divisors is an integer number (9885298447296).
Almost surely, 2243007100313152 is an apocalyptic number.
It is an amenable number.
243007100313152 is an abundant number, since it is smaller than the sum of its proper divisors (310569612735424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243007100313152 is a wasteful number, since it uses less digits than its factorization.
243007100313152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2432406355 (or 2432406345 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 243007100313152 in words is "two hundred forty-three trillion, seven billion, one hundred million, three hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •