Base | Representation |
---|---|
bin | 10101101001010… |
… | …010101110011100 |
3 | 221022022201212001 |
4 | 111221102232130 |
5 | 1220431134030 |
6 | 100011252044 |
7 | 11666456050 |
oct | 2551225634 |
9 | 838281761 |
10 | 363146140 |
11 | 176a94085 |
12 | a174a024 |
13 | 5a309a96 |
14 | 3632dc60 |
15 | 21d33cca |
hex | 15a52b9c |
363146140 has 48 divisors (see below), whose sum is σ = 875028672. Its totient is φ = 124010496.
The previous prime is 363146131. The next prime is 363146159. The reversal of 363146140 is 41641363.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 363146099 and 363146108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30934 + ... + 41026.
It is an arithmetic number, because the mean of its divisors is an integer number (18229764).
Almost surely, 2363146140 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 363146140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (437514336).
363146140 is an abundant number, since it is smaller than the sum of its proper divisors (511882532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
363146140 is a wasteful number, since it uses less digits than its factorization.
363146140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10366 (or 10364 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 363146140 is about 19056.3936777135. The cubic root of 363146140 is about 713.4449651092. Note that the first 3 decimals are identical.
The spelling of 363146140 in words is "three hundred sixty-three million, one hundred forty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •