Base | Representation |
---|---|
bin | 1100101010001… |
… | …1111010111111 |
3 | 10200220202210221 |
4 | 3022203322333 |
5 | 102043201343 |
6 | 5134042211 |
7 | 1213226101 |
oct | 312437277 |
9 | 120822727 |
10 | 53100223 |
11 | 27a78a90 |
12 | 15949367 |
13 | b002567 |
14 | 70a3571 |
15 | 49dd5ed |
hex | 32a3ebf |
53100223 has 8 divisors (see below), whose sum is σ = 59021136. Its totient is φ = 47361600.
The previous prime is 53100221. The next prime is 53100239. The reversal of 53100223 is 32200135.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53100223 - 21 = 53100221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53100197 and 53100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53100221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44958 + ... + 46123.
It is an arithmetic number, because the mean of its divisors is an integer number (7377642).
Almost surely, 253100223 is an apocalyptic number.
53100223 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
53100223 is a deficient number, since it is larger than the sum of its proper divisors (5920913).
53100223 is a wasteful number, since it uses less digits than its factorization.
53100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91145.
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 53100223 is about 7286.9899821531. The cubic root of 53100223 is about 375.8651975460.
Adding to 53100223 its reverse (32200135), we get a palindrome (85300358).
The spelling of 53100223 in words is "fifty-three million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •