Base | Representation |
---|---|
bin | 1111101111111101010… |
… | …10000001100110011010 |
3 | 1220201210012200000101020 |
4 | 13313332222001212122 |
5 | 32331230143411331 |
6 | 1052333043503310 |
7 | 54045015336240 |
oct | 7677652014632 |
9 | 1821705600336 |
10 | 541143341466 |
11 | 199552343942 |
12 | 88a63987b36 |
13 | 3c050047740 |
14 | 1c2975b2790 |
15 | e122bb2c96 |
hex | 7dfea8199a |
541143341466 has 128 divisors (see below), whose sum is σ = 1346101618176. Its totient is φ = 141214924800.
The previous prime is 541143341449. The next prime is 541143341489. The reversal of 541143341466 is 664143341145.
It is a super-2 number, since 2×5411433414662 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 149609290 + ... + 149612906.
It is an arithmetic number, because the mean of its divisors is an integer number (10516418892).
Almost surely, 2541143341466 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 541143341466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (673050809088).
541143341466 is an abundant number, since it is smaller than the sum of its proper divisors (804958276710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
541143341466 is a wasteful number, since it uses less digits than its factorization.
541143341466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6456.
The product of its digits is 414720, while the sum is 42.
The spelling of 541143341466 in words is "five hundred forty-one billion, one hundred forty-three million, three hundred forty-one thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •