Base | Representation |
---|---|
bin | 11000001100101111111101… |
… | …11000110001010110010001 |
3 | 20222102021020210100100222011 |
4 | 30012113332320301112101 |
5 | 23433332023242001301 |
6 | 305102243423342521 |
7 | 14131426020556522 |
oct | 1406277670612621 |
9 | 228367223310864 |
10 | 53214626125201 |
11 | 15a57218166342 |
12 | 5b75426751a41 |
13 | 239016b7c5ba8 |
14 | d1d85ccc2849 |
15 | 62437b8d9a51 |
hex | 3065fee31591 |
53214626125201 has 4 divisors (see below), whose sum is σ = 53567040867904. Its totient is φ = 52862211382500.
The previous prime is 53214626125117. The next prime is 53214626125229. The reversal of 53214626125201 is 10252162641235.
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 a de Polignac number, because none of the positive numbers 2k-53214626125201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53214626126201) 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, 176207371125 + ... + 176207371426.
It is an arithmetic number, because the mean of its divisors is an integer number (13391760216976).
Almost surely, 253214626125201 is an apocalyptic number.
It is an amenable number.
53214626125201 is a deficient number, since it is larger than the sum of its proper divisors (352414742703).
53214626125201 is a wasteful number, since it uses less digits than its factorization.
53214626125201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 352414742702.
The product of its (nonzero) digits is 172800, while the sum is 40.
Adding to 53214626125201 its reverse (10252162641235), we get a palindrome (63466788766436).
The spelling of 53214626125201 in words is "fifty-three trillion, two hundred fourteen billion, six hundred twenty-six million, one hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •