Base | Representation |
---|---|
bin | 100111010011011011… |
… | …100000000000000000 |
3 | 11000221010100000100000 |
4 | 213103123200000000 |
5 | 1142412142012300 |
6 | 31215353200000 |
7 | 3022542202215 |
oct | 472333400000 |
9 | 130833300300 |
10 | 42201907200 |
11 | 16996970562 |
12 | 8219400000 |
13 | 3c9730102b |
14 | 2084bc3b0c |
15 | 116ee7dc00 |
hex | 9d36e0000 |
42201907200 has 648 divisors, whose sum is σ = 159733167048. Its totient is φ = 11041505280.
The previous prime is 42201907183. The next prime is 42201907277. The reversal of 42201907200 is 270910224.
It is a tau number, because it is divible by the number of its divisors (648).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 796262374 + ... + 796262426.
It is an arithmetic number, because the mean of its divisors is an integer number (246501801).
Almost surely, 242201907200 is an apocalyptic number.
42201907200 is a gapful number since it is divisible by the number (40) 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 42201907200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79866583524).
42201907200 is an abundant number, since it is smaller than the sum of its proper divisors (117531259848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42201907200 is an frugal number, since it uses more digits than its factorization.
42201907200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112 (or 63 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The spelling of 42201907200 in words is "forty-two billion, two hundred one million, nine hundred seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •