Base | Representation |
---|---|
bin | 110001100011110001… |
… | …111011100110100001 |
3 | 12002100112212001111002 |
4 | 301203301323212201 |
5 | 1332440143003441 |
6 | 40240201001345 |
7 | 3562453325564 |
oct | 614361734641 |
9 | 162315761432 |
10 | 53213641121 |
11 | 20627793203 |
12 | a391183255 |
13 | 50307a6514 |
14 | 280b46a4db |
15 | 15b6a89b9b |
hex | c63c7b9a1 |
53213641121 has 4 divisors (see below), whose sum is σ = 53214244272. Its totient is φ = 53213037972.
The previous prime is 53213641099. The next prime is 53213641163. The reversal of 53213641121 is 12114631235.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53213641121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53213691121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140591 + ... + 355236.
It is an arithmetic number, because the mean of its divisors is an integer number (13303561068).
Almost surely, 253213641121 is an apocalyptic number.
It is an amenable number.
53213641121 is a deficient number, since it is larger than the sum of its proper divisors (603151).
53213641121 is a wasteful number, since it uses less digits than its factorization.
53213641121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603150.
The product of its digits is 4320, while the sum is 29.
The spelling of 53213641121 in words is "fifty-three billion, two hundred thirteen million, six hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •