Base | Representation |
---|---|
bin | 1111100100011000001… |
… | …10010100101111001100 |
3 | 1220010201221102022110001 |
4 | 13302030012110233030 |
5 | 32231012130201443 |
6 | 1045424121254044 |
7 | 53434655325520 |
oct | 7621406245714 |
9 | 1803657368401 |
10 | 534926412748 |
11 | 196952018322 |
12 | 87809934324 |
13 | 3b59c0481b0 |
14 | 1bc67a55d80 |
15 | ddabec9d4d |
hex | 7c8c194bcc |
534926412748 has 96 divisors (see below), whose sum is σ = 1166186609280. Its totient is φ = 209045422080.
The previous prime is 534926412689. The next prime is 534926412773. The reversal of 534926412748 is 847214629435.
It is a super-2 number, since 2×5349264127482 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37345428 + ... + 37359748.
It is an arithmetic number, because the mean of its divisors is an integer number (12147777180).
Almost surely, 2534926412748 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 534926412748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (583093304640).
534926412748 is an abundant number, since it is smaller than the sum of its proper divisors (631260196532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534926412748 is a wasteful number, since it uses less digits than its factorization.
534926412748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15587 (or 15585 counting only the distinct ones).
The product of its digits is 11612160, while the sum is 55.
The spelling of 534926412748 in words is "five hundred thirty-four billion, nine hundred twenty-six million, four hundred twelve thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •