Base | Representation |
---|---|
bin | 10110000000001… |
… | …010101000000000 |
3 | 221201121101000000 |
4 | 112000022220000 |
5 | 1224000023042 |
6 | 100344000000 |
7 | 12101441352 |
oct | 2600125000 |
9 | 851541000 |
10 | 369142272 |
11 | 17a40a064 |
12 | a3760000 |
13 | 5b6290a5 |
14 | 370510d2 |
15 | 2261a74c |
hex | 1600aa00 |
369142272 has 280 divisors, whose sum is σ = 1180754784. Its totient is φ = 114960384.
The previous prime is 369142271. The next prime is 369142283. The reversal of 369142272 is 272241963.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (369142271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 8584683 + ... + 8584725.
Almost surely, 2369142272 is an apocalyptic number.
369142272 is a gapful number since it is divisible by the number (32) 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 369142272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (590377392).
369142272 is an abundant number, since it is smaller than the sum of its proper divisors (811612512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
369142272 is an frugal number, since it uses more digits than its factorization.
369142272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102 (or 71 counting only the distinct ones).
The product of its digits is 36288, while the sum is 36.
The square root of 369142272 is about 19213.0755476576. The cubic root of 369142272 is about 717.3502604071.
The spelling of 369142272 in words is "three hundred sixty-nine million, one hundred forty-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •