Base | Representation |
---|---|
bin | 100111110011101011… |
… | …101000010000000000 |
3 | 11002022211111200122000 |
4 | 213303223220100000 |
5 | 1200014202144313 |
6 | 31345202544000 |
7 | 3042132362310 |
oct | 476353502000 |
9 | 132284450560 |
10 | 42743006208 |
11 | 17144349221 |
12 | 834a668000 |
13 | 4052445c66 |
14 | 20d69d7440 |
15 | 11a2714673 |
hex | 9f3ae8400 |
42743006208 has 704 divisors, whose sum is σ = 152933498880. Its totient is φ = 11537842176.
The previous prime is 42743006203. The next prime is 42743006249. The reversal of 42743006208 is 80260034724.
42743006208 is a `hidden beast` number, since 4 + 27 + 4 + 3 + 0 + 0 + 620 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42743006203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 336559041 + ... + 336559167.
Almost surely, 242743006208 is an apocalyptic number.
42743006208 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42743006208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76466749440).
42743006208 is an abundant number, since it is smaller than the sum of its proper divisors (110190492672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42743006208 is a wasteful number, since it uses less digits than its factorization.
42743006208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247 (or 223 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 36.
The spelling of 42743006208 in words is "forty-two billion, seven hundred forty-three million, six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •