Base | Representation |
---|---|
bin | 1100110000010… |
… | …1010011011101 |
3 | 10201200000222012 |
4 | 3030011103131 |
5 | 102143432401 |
6 | 5150401005 |
7 | 1216510025 |
oct | 314052335 |
9 | 121600865 |
10 | 53499101 |
11 | 28220737 |
12 | 15b00165 |
13 | b111c96 |
14 | 7168a85 |
15 | 4a6b8bb |
hex | 33054dd |
53499101 has 4 divisors (see below), whose sum is σ = 54508572. Its totient is φ = 52489632.
The previous prime is 53499097. The next prime is 53499107. The reversal of 53499101 is 10199435.
53499101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36893476 + 16605625 = 6074^2 + 4075^2 .
It is a cyclic number.
It is not a de Polignac number, because 53499101 - 22 = 53499097 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 (53499107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 504656 + ... + 504761.
It is an arithmetic number, because the mean of its divisors is an integer number (13627143).
Almost surely, 253499101 is an apocalyptic number.
It is an amenable number.
53499101 is a deficient number, since it is larger than the sum of its proper divisors (1009471).
53499101 is a wasteful number, since it uses less digits than its factorization.
53499101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009470.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 53499101 is about 7314.3079645309. The cubic root of 53499101 is about 376.8039915741.
The spelling of 53499101 in words is "fifty-three million, four hundred ninety-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •