Base | Representation |
---|---|
bin | 110001100011101000… |
… | …010000011111110101 |
3 | 12002100101002012221122 |
4 | 301203220100133311 |
5 | 1332434020332034 |
6 | 40240030353325 |
7 | 3562422634460 |
oct | 614350203765 |
9 | 162311065848 |
10 | 53211105269 |
11 | 20626310a63 |
12 | a39035b845 |
13 | 50300c920a |
14 | 280adaa2d7 |
15 | 15b673862e |
hex | c63a107f5 |
53211105269 has 4 divisors (see below), whose sum is σ = 60812691744. Its totient is φ = 45609518796.
The previous prime is 53211105257. The next prime is 53211105301. The reversal of 53211105269 is 96250111235.
53211105269 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 53211105269 - 220 = 53210056693 is a prime.
It is a super-2 number, since 2×532111052692 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53211105769) 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, 3800793227 + ... + 3800793240.
It is an arithmetic number, because the mean of its divisors is an integer number (15203172936).
Almost surely, 253211105269 is an apocalyptic number.
It is an amenable number.
53211105269 is a deficient number, since it is larger than the sum of its proper divisors (7601586475).
53211105269 is an equidigital number, since it uses as much as digits as its factorization.
53211105269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7601586474.
The product of its (nonzero) digits is 16200, while the sum is 35.
The spelling of 53211105269 in words is "fifty-three billion, two hundred eleven million, one hundred five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •