Base | Representation |
---|---|
bin | 110001111000100111… |
… | …011101110100000001 |
3 | 12010020220122110110101 |
4 | 301320213131310001 |
5 | 1334144141003301 |
6 | 40335005402401 |
7 | 3604226564632 |
oct | 617047356401 |
9 | 163226573411 |
10 | 53563219201 |
11 | 2079704a408 |
12 | a46a269401 |
13 | 508804265b |
14 | 2841a67889 |
15 | 15d75dd701 |
hex | c789ddd01 |
53563219201 has 8 divisors (see below), whose sum is σ = 55014183080. Its totient is φ = 52112429568.
The previous prime is 53563219189. The next prime is 53563219247. The reversal of 53563219201 is 10291236535.
53563219201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 11189408400 + 42373810801 = 105780^2 + 205849^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53563219201 - 217 = 53563088129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53563219301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 795295 + ... + 860011.
It is an arithmetic number, because the mean of its divisors is an integer number (6876772885).
Almost surely, 253563219201 is an apocalyptic number.
It is an amenable number.
53563219201 is a deficient number, since it is larger than the sum of its proper divisors (1450963879).
53563219201 is a wasteful number, since it uses less digits than its factorization.
53563219201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87123.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 53563219201 in words is "fifty-three billion, five hundred sixty-three million, two hundred nineteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •