Base | Representation |
---|---|
bin | 10111111011100101111110… |
… | …11000100100101000010100 |
3 | 20220022220201012101201112122 |
4 | 23331302333120210220110 |
5 | 23344202301422402330 |
6 | 303531354340435112 |
7 | 14041020165101354 |
oct | 1375627730445024 |
9 | 226286635351478 |
10 | 52625150200340 |
11 | 1584a223398203 |
12 | 5a9b1343a8a98 |
13 | 23496b82ba1a3 |
14 | cdd0dc622b64 |
15 | 613d7a94b5e5 |
hex | 2fdcbf624a14 |
52625150200340 has 48 divisors (see below), whose sum is σ = 111393308780544. Its totient is φ = 20882377756800.
The previous prime is 52625150200327. The next prime is 52625150200361. The reversal of 52625150200340 is 4300205152625.
It is a super-2 number, since 2×526251502003402 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52625150200340.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26633135 + ... + 28540745.
It is an arithmetic number, because the mean of its divisors is an integer number (2320693932928).
Almost surely, 252625150200340 is an apocalyptic number.
It is an amenable number.
52625150200340 is an abundant number, since it is smaller than the sum of its proper divisors (58768158580204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52625150200340 is a wasteful number, since it uses less digits than its factorization.
52625150200340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1918608 (or 1918606 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 52625150200340 its reverse (4300205152625), we get a palindrome (56925355352965).
The spelling of 52625150200340 in words is "fifty-two trillion, six hundred twenty-five billion, one hundred fifty million, two hundred thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •