Base | Representation |
---|---|
bin | 10011010101110011001001… |
… | …01111100101110111100000 |
3 | 12120120212112122000002111200 |
4 | 21222321210233211313200 |
5 | 21033304333312044324 |
6 | 230242115534041200 |
7 | 11646503233166010 |
oct | 1152714457456740 |
9 | 176525478002450 |
10 | 42530456362464 |
11 | 12608079939244 |
12 | 492a82b949200 |
13 | 1a967b2a58645 |
14 | a706b106dc40 |
15 | 4db4ac54eec9 |
hex | 26ae64be5de0 |
42530456362464 has 144 divisors (see below), whose sum is σ = 139051672800768. Its totient is φ = 12078795038976.
The previous prime is 42530456362369. The next prime is 42530456362549. The reversal of 42530456362464 is 46426365403524.
42530456362464 is a `hidden beast` number, since 4 + 2 + 5 + 3 + 0 + 4 + 5 + 6 + 3 + 624 + 6 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a self number, because there is not a number n which added to its sum of digits gives 42530456362464.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62826372 + ... + 63499715.
It is an arithmetic number, because the mean of its divisors is an integer number (965636616672).
Almost surely, 242530456362464 is an apocalyptic number.
It is an amenable number.
42530456362464 is an abundant number, since it is smaller than the sum of its proper divisors (96521216438304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42530456362464 is a wasteful number, since it uses less digits than its factorization.
42530456362464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126326277 (or 126326266 counting only the distinct ones).
The product of its (nonzero) digits is 49766400, while the sum is 54.
The spelling of 42530456362464 in words is "forty-two trillion, five hundred thirty billion, four hundred fifty-six million, three hundred sixty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •