Base | Representation |
---|---|
bin | 1111110011010000110… |
… | …10011111111111000000 |
3 | 1220220100212100120001022 |
4 | 13321220122133333000 |
5 | 32343343410002022 |
6 | 1053225105325012 |
7 | 54140001636350 |
oct | 7715032377700 |
9 | 1826325316038 |
10 | 542917656512 |
11 | 19a282955010 |
12 | 8927a036768 |
13 | 3c2738138ba |
14 | 1c3c50c0b60 |
15 | e1c8845c42 |
hex | 7e6869ffc0 |
542917656512 has 336 divisors, whose sum is σ = 1465557209088. Its totient is φ = 193684193280.
The previous prime is 542917656509. The next prime is 542917656581. The reversal of 542917656512 is 215656719245.
It is a super-2 number, since 2×5429176565122 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 52689953 + ... + 52700255.
It is an arithmetic number, because the mean of its divisors is an integer number (4361777408).
Almost surely, 2542917656512 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 542917656512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (732778604544).
542917656512 is an abundant number, since it is smaller than the sum of its proper divisors (922639552576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
542917656512 is a wasteful number, since it uses less digits than its factorization.
542917656512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10404 (or 10377 counting only the distinct ones).
The product of its digits is 4536000, while the sum is 53.
The spelling of 542917656512 in words is "five hundred forty-two billion, nine hundred seventeen million, six hundred fifty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •