Base | Representation |
---|---|
bin | 100000010000011… |
… | …000101100111000 |
3 | 1101201022002201201 |
4 | 200100120230320 |
5 | 2102014311032 |
6 | 125411023544 |
7 | 16260560404 |
oct | 4020305470 |
9 | 1351262651 |
10 | 541166392 |
11 | 258524358 |
12 | 13129abb4 |
13 | 88169800 |
14 | 51c30104 |
15 | 3279a8e7 |
hex | 20418b38 |
541166392 has 48 divisors (see below), whose sum is σ = 1102238280. Its totient is φ = 248976000.
The previous prime is 541166377. The next prime is 541166393. The reversal of 541166392 is 293661145.
It is a super-2 number, since 2×5411663922 = 585722127660595328, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541166393) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 771642 + ... + 772342.
Almost surely, 2541166392 is an apocalyptic number.
541166392 is a gapful number since it is divisible by the number (52) 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 541166392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (551119140).
541166392 is an abundant number, since it is smaller than the sum of its proper divisors (561071888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
541166392 is a wasteful number, since it uses less digits than its factorization.
541166392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1304 (or 1287 counting only the distinct ones).
The product of its digits is 38880, while the sum is 37.
The square root of 541166392 is about 23262.9832996544. The cubic root of 541166392 is about 814.9111735277.
The spelling of 541166392 in words is "five hundred forty-one million, one hundred sixty-six thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •