Base | Representation |
---|---|
bin | 10101111011111… |
… | …010000100000000 |
3 | 221122111122120021 |
4 | 111323322010000 |
5 | 1223203311411 |
6 | 100304023224 |
7 | 12056111452 |
oct | 2573720400 |
9 | 848448507 |
10 | 368025856 |
11 | 179817300 |
12 | a3301b14 |
13 | 5b327ba3 |
14 | 36c402d2 |
15 | 22499a71 |
hex | 15efa100 |
368025856 has 81 divisors (see below), whose sum is σ = 814944333. Its totient is φ = 165749760.
The previous prime is 368025851. The next prime is 368025869. The reversal of 368025856 is 658520863.
It is a happy number.
The square root of 368025856 is 19184.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 256512256 + 111513600 = 16016^2 + 10560^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (368025851) 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 8 ways as a sum of consecutive naturals, for example, 3376330 + ... + 3376438.
Almost surely, 2368025856 is an apocalyptic number.
368025856 is the 19184-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 368025856
368025856 is an abundant number, since it is smaller than the sum of its proper divisors (446918477).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
368025856 is an equidigital number, since it uses as much as digits as its factorization.
368025856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256 (or 122 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 43.
The cubic root of 368025856 is about 716.6263570141.
The spelling of 368025856 in words is "three hundred sixty-eight million, twenty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •