Base | Representation |
---|---|
bin | 100111011100011110… |
… | …010100001001000000 |
3 | 11001022200211211121100 |
4 | 213130132110021000 |
5 | 1143220012440000 |
6 | 31242413254400 |
7 | 3026364000000 |
oct | 473436241100 |
9 | 131280754540 |
10 | 42353640000 |
11 | 16a64586671 |
12 | 8260194400 |
13 | 3cbc888859 |
14 | 209b000000 |
15 | 117d451a00 |
hex | 9dc794240 |
42353640000 has 735 divisors, whose sum is σ = 176983430767. Its totient is φ = 9680832000.
The previous prime is 42353639989. The next prime is 42353640061. The reversal of 42353640000 is 4635324.
The square root of 42353640000 is 205800.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 3320525376 + 39033114624 = 57624^2 + 197568^2 .
It is a tau number, because it is divible by the number of its divisors (735).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 104 ways as a sum of consecutive naturals, for example, 6050519997 + ... + 6050520003.
Almost surely, 242353640000 is an apocalyptic number.
42353640000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
42353640000 is the 205800-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42353640000
42353640000 is an abundant number, since it is smaller than the sum of its proper divisors (134629790767).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42353640000 is an frugal number, since it uses more digits than its factorization.
42353640000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
The spelling of 42353640000 in words is "forty-two billion, three hundred fifty-three million, six hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •