Base | Representation |
---|---|
bin | 11000010110010001111100… |
… | …01001101111110011110010 |
3 | 21000120120112100201122011121 |
4 | 30023020332021233303302 |
5 | 24004213212343220300 |
6 | 305512523053332454 |
7 | 14164201163543425 |
oct | 1413107611576362 |
9 | 230516470648147 |
10 | 53542105054450 |
11 | 16073096510921 |
12 | 600899a79712a |
13 | 23b4cca5c083c |
14 | d316476d59bc |
15 | 62cb466d381a |
hex | 30b23e26fcf2 |
53542105054450 has 12 divisors (see below), whose sum is σ = 99588315401370. Its totient is φ = 21416842021760.
The previous prime is 53542105054411. The next prime is 53542105054457. The reversal of 53542105054450 is 5445050124535.
It can be written as a sum of positive squares in 3 ways, for example, as 37992640009489 + 15549465044961 = 6163817^2 + 3943281^2 .
It is a junction number, because it is equal to n+sod(n) for n = 53542105054397 and 53542105054406.
It is not an unprimeable number, because it can be changed into a prime (53542105054457) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 535421050495 + ... + 535421050594.
Almost surely, 253542105054450 is an apocalyptic number.
53542105054450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53542105054450 is a deficient number, since it is larger than the sum of its proper divisors (46046210346920).
53542105054450 is a wasteful number, since it uses less digits than its factorization.
53542105054450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070842101101 (or 1070842101096 counting only the distinct ones).
The product of its (nonzero) digits is 1200000, while the sum is 43.
Adding to 53542105054450 its reverse (5445050124535), we get a palindrome (58987155178985).
The spelling of 53542105054450 in words is "fifty-three trillion, five hundred forty-two billion, one hundred five million, fifty-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •