Base | Representation |
---|---|
bin | 11000010010110011000100… |
… | …10010010101001010110001 |
3 | 21000011010200112202211222221 |
4 | 30021121202102111022301 |
5 | 24000233140230400423 |
6 | 305341534041401041 |
7 | 14152434111216463 |
oct | 1411314222251261 |
9 | 230133615684887 |
10 | 53422452200113 |
11 | 16027375601447 |
12 | 5ba9767199181 |
13 | 23a693c300409 |
14 | d29936516133 |
15 | 629991e50e5d |
hex | 3096624952b1 |
53422452200113 has 6 divisors (see below), whose sum is σ = 54073850956514. Its totient is φ = 52778808190896.
The previous prime is 53422452200071. The next prime is 53422452200119. The reversal of 53422452200113 is 31100225422435.
It can be written as a sum of positive squares in only one way, i.e., 46018219370929 + 7404232829184 = 6783673^2 + 2721072^2 .
It is not a de Polignac number, because 53422452200113 - 29 = 53422452199601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53422452200119) 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 5 ways as a sum of consecutive naturals, for example, 3877366620 + ... + 3877380397.
Almost surely, 253422452200113 is an apocalyptic number.
It is an amenable number.
53422452200113 is a deficient number, since it is larger than the sum of its proper divisors (651398756401).
53422452200113 is an frugal number, since it uses more digits than its factorization.
53422452200113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7754747183 (or 7754747100 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 53422452200113 its reverse (31100225422435), we get a palindrome (84522677622548).
The spelling of 53422452200113 in words is "fifty-three trillion, four hundred twenty-two billion, four hundred fifty-two million, two hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •