Base | Representation |
---|---|
bin | 10110011100000… |
… | …000100101001100 |
3 | 222020100012012100 |
4 | 112130000211030 |
5 | 1232332104124 |
6 | 101204235100 |
7 | 12220461051 |
oct | 2634004514 |
9 | 866305170 |
10 | 376441164 |
11 | 183544900 |
12 | a609ba90 |
13 | 5ccb3368 |
14 | 37dd1028 |
15 | 230ad1c9 |
hex | 1670094c |
376441164 has 108 divisors (see below), whose sum is σ = 1058770440. Its totient is φ = 112675200.
The previous prime is 376441157. The next prime is 376441211. The reversal of 376441164 is 461144673.
376441164 is a `hidden beast` number, since 3 + 7 + 644 + 1 + 1 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 387199 + ... + 388169.
It is an arithmetic number, because the mean of its divisors is an integer number (9803430).
Almost surely, 2376441164 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 376441164, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (529385220).
376441164 is an abundant number, since it is smaller than the sum of its proper divisors (682329276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
376441164 is a wasteful number, since it uses less digits than its factorization.
376441164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1092 (or 1076 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 376441164 is about 19402.0917429024. The cubic root of 376441164 is about 722.0473901210.
The spelling of 376441164 in words is "three hundred seventy-six million, four hundred forty-one thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •