Base | Representation |
---|---|
bin | 10111110111101… |
… | …10110100001000 |
3 | 111221210021011211 |
4 | 23323312310020 |
5 | 402230143032 |
6 | 31511502504 |
7 | 4651005142 |
oct | 1373666410 |
9 | 457707154 |
10 | 200240392 |
11 | a3037630 |
12 | 57087a34 |
13 | 3263c851 |
14 | 1c845c92 |
15 | 128a5747 |
hex | bef6d08 |
200240392 has 128 divisors (see below), whose sum is σ = 464486400. Its totient is φ = 79833600.
The previous prime is 200240371. The next prime is 200240401. The reversal of 200240392 is 293042002.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1576633 + ... + 1576759.
It is an arithmetic number, because the mean of its divisors is an integer number (3628800).
Almost surely, 2200240392 is an apocalyptic number.
200240392 is a gapful number since it is divisible by the number (22) 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 200240392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232243200).
200240392 is an abundant number, since it is smaller than the sum of its proper divisors (264246008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200240392 is a wasteful number, since it uses less digits than its factorization.
200240392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227 (or 223 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 200240392 is about 14150.6322120250. The cubic root of 200240392 is about 585.0377573214.
Adding to 200240392 its reverse (293042002), we get a palindrome (493282394).
The spelling of 200240392 in words is "two hundred million, two hundred forty thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •