Base | Representation |
---|---|
bin | 10110101111111… |
… | …100001111100000 |
3 | 222121011122200212 |
4 | 112233330033200 |
5 | 1240201310042 |
6 | 101512233252 |
7 | 12313052441 |
oct | 2657741740 |
9 | 877148625 |
10 | 381666272 |
11 | 186493579 |
12 | a799b828 |
13 | 610c2740 |
14 | 389912c8 |
15 | 23791482 |
hex | 16bfc3e0 |
381666272 has 48 divisors (see below), whose sum is σ = 811595232. Its totient is φ = 175633920.
The previous prime is 381666247. The next prime is 381666377. The reversal of 381666272 is 272666183.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 163997 + ... + 166307.
It is an arithmetic number, because the mean of its divisors is an integer number (16908234).
Almost surely, 2381666272 is an apocalyptic number.
381666272 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 381666272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (405797616).
381666272 is an abundant number, since it is smaller than the sum of its proper divisors (429928960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
381666272 is a wasteful number, since it uses less digits than its factorization.
381666272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2731 (or 2723 counting only the distinct ones).
The product of its digits is 145152, while the sum is 41.
The square root of 381666272 is about 19536.2809152612. The cubic root of 381666272 is about 725.3727909199.
The spelling of 381666272 in words is "three hundred eighty-one million, six hundred sixty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •