Base | Representation |
---|---|
bin | 10101111100111… |
… | …001100100000000 |
3 | 221122222212100110 |
4 | 111330321210000 |
5 | 1223240122302 |
6 | 100313351320 |
7 | 12061243656 |
oct | 2574714400 |
9 | 848885313 |
10 | 368285952 |
11 | 179984761 |
12 | a3408540 |
13 | 5b3b93a8 |
14 | 36caadd6 |
15 | 224ebb6c |
hex | 15f39900 |
368285952 has 108 divisors (see below), whose sum is σ = 1014846000. Its totient is φ = 118563840.
The previous prime is 368285899. The next prime is 368285971. The reversal of 368285952 is 259582863.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 737799 + ... + 738297.
Almost surely, 2368285952 is an apocalyptic number.
368285952 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 368285952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (507423000).
368285952 is an abundant number, since it is smaller than the sum of its proper divisors (646560048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
368285952 is an equidigital number, since it uses as much as digits as its factorization.
368285952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580 (or 535 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 48.
The square root of 368285952 is about 19190.7777851759. Note that the first 4 decimals coincide. The cubic root of 368285952 is about 716.7951384130.
The spelling of 368285952 in words is "three hundred sixty-eight million, two hundred eighty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •