Base | Representation |
---|---|
bin | 10101101001101… |
… | …001101010001000 |
3 | 221022111111201000 |
4 | 111221221222020 |
5 | 1220442140242 |
6 | 100013255000 |
7 | 12000326646 |
oct | 2551515210 |
9 | 838444630 |
10 | 363240072 |
11 | 177048708 |
12 | a1794460 |
13 | 5a340770 |
14 | 36356196 |
15 | 21d51a4c |
hex | 15a69a88 |
363240072 has 128 divisors (see below), whose sum is σ = 1092873600. Its totient is φ = 111124224.
The previous prime is 363239983. The next prime is 363240077. The reversal of 363240072 is 270042363.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (363240077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 777583 + ... + 778049.
It is an arithmetic number, because the mean of its divisors is an integer number (8538075).
Almost surely, 2363240072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 363240072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (546436800).
363240072 is an abundant number, since it is smaller than the sum of its proper divisors (729633528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
363240072 is a wasteful number, since it uses less digits than its factorization.
363240072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772 (or 762 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 27.
The square root of 363240072 is about 19058.8580980079. The cubic root of 363240072 is about 713.5064734368.
The spelling of 363240072 in words is "three hundred sixty-three million, two hundred forty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •