Base | Representation |
---|---|
bin | 110001110000100010… |
… | …011010011010000001 |
3 | 12002220110121012020111 |
4 | 301300202122122001 |
5 | 1333404441124201 |
6 | 40313324311321 |
7 | 3600662521402 |
oct | 616042323201 |
9 | 162813535214 |
10 | 53427676801 |
11 | 207275923a4 |
12 | a4309a2541 |
13 | 5065c36255 |
14 | 282ba639a9 |
15 | 15ca767b51 |
hex | c7089a681 |
53427676801 has 4 divisors (see below), whose sum is σ = 53635566852. Its totient is φ = 53219786752.
The previous prime is 53427676777. The next prime is 53427676811. The reversal of 53427676801 is 10867672435.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10867672435 = 5 ⋅2173534487.
It can be written as a sum of positive squares in 2 ways, for example, as 24641464576 + 28786212225 = 156976^2 + 169665^2 .
It is a cyclic number.
It is not a de Polignac number, because 53427676801 - 215 = 53427644033 is a prime.
It is a super-2 number, since 2×534276768012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53427676811) 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, 103944640 + ... + 103945153.
It is an arithmetic number, because the mean of its divisors is an integer number (13408891713).
Almost surely, 253427676801 is an apocalyptic number.
It is an amenable number.
53427676801 is a deficient number, since it is larger than the sum of its proper divisors (207890051).
53427676801 is a wasteful number, since it uses less digits than its factorization.
53427676801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207890050.
The product of its (nonzero) digits is 1693440, while the sum is 49.
The spelling of 53427676801 in words is "fifty-three billion, four hundred twenty-seven million, six hundred seventy-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •