Base | Representation |
---|---|
bin | 110001101110111001… |
… | …110011011010010101 |
3 | 12002211112222222100221 |
4 | 301232321303122111 |
5 | 1333330431112401 |
6 | 40310504434341 |
7 | 3600210446005 |
oct | 615671633225 |
9 | 162745888327 |
10 | 53400254101 |
11 | 20713062307 |
12 | a4237789b1 |
13 | 50603543bc |
14 | 2828166005 |
15 | 15c814c7a1 |
hex | c6ee73695 |
53400254101 has 4 divisors (see below), whose sum is σ = 53400726252. Its totient is φ = 53399781952.
The previous prime is 53400254041. The next prime is 53400254113. The reversal of 53400254101 is 10145200435.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 11369103876 + 42031150225 = 106626^2 + 205015^2 .
It is a cyclic number.
It is not a de Polignac number, because 53400254101 - 221 = 53398156949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53490254101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45615 + ... + 329971.
It is an arithmetic number, because the mean of its divisors is an integer number (13350181563).
Almost surely, 253400254101 is an apocalyptic number.
It is an amenable number.
53400254101 is a deficient number, since it is larger than the sum of its proper divisors (472151).
53400254101 is a wasteful number, since it uses less digits than its factorization.
53400254101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472150.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 53400254101 its reverse (10145200435), we get a palindrome (63545454536).
The spelling of 53400254101 in words is "fifty-three billion, four hundred million, two hundred fifty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •