Base | Representation |
---|---|
bin | 10111111100010010101110… |
… | …11000011010001101000000 |
3 | 20220102012201112112122121020 |
4 | 23332021113120122031000 |
5 | 23400101002313142234 |
6 | 303550410330225440 |
7 | 14042530432455000 |
oct | 1376112730321500 |
9 | 226365645478536 |
10 | 52649175130944 |
11 | 15859431889157 |
12 | 5aa391a285280 |
13 | 234ba46804c62 |
14 | d0033b2ac000 |
15 | 6147d4c14549 |
hex | 2fe25761a340 |
52649175130944 has 448 divisors, whose sum is σ = 169037300736000. Its totient is φ = 14444736423936.
The previous prime is 52649175130919. The next prime is 52649175130967. The reversal of 52649175130944 is 44903157194625.
It is a tau number, because it is divible by the number of its divisors (448).
It is a super-2 number, since 2×526491751309442 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 163886827 + ... + 164207765.
Almost surely, 252649175130944 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 52649175130944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84518650368000).
52649175130944 is an abundant number, since it is smaller than the sum of its proper divisors (116388125605056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52649175130944 is a wasteful number, since it uses less digits than its factorization.
52649175130944 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321075 (or 321051 counting only the distinct ones).
The product of its (nonzero) digits is 32659200, while the sum is 60.
The spelling of 52649175130944 in words is "fifty-two trillion, six hundred forty-nine billion, one hundred seventy-five million, one hundred thirty thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.353 sec. • engine limits •