Base | Representation |
---|---|
bin | 11000001010111011111010… |
… | …11110000001101101100011 |
3 | 20222012022102221101002221102 |
4 | 30011131331132001231203 |
5 | 23431321430234430311 |
6 | 305013501404545015 |
7 | 14124062112440621 |
oct | 1405357536015543 |
9 | 228168387332842 |
10 | 53152325311331 |
11 | 15a32857a61814 |
12 | 5b6533a25216b |
13 | 238732049a29c |
14 | d1a82ca2c511 |
15 | 6229321a443b |
hex | 30577d781b63 |
53152325311331 has 4 divisors (see below), whose sum is σ = 54985164115200. Its totient is φ = 51319486507464.
The previous prime is 53152325311291. The next prime is 53152325311361. The reversal of 53152325311331 is 13311352325135.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 53152325311331 - 226 = 53152258202467 is a prime.
It is a super-2 number, since 2×531523253113312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53152325311361) 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, 916419401891 + ... + 916419401948.
It is an arithmetic number, because the mean of its divisors is an integer number (13746291028800).
Almost surely, 253152325311331 is an apocalyptic number.
53152325311331 is a deficient number, since it is larger than the sum of its proper divisors (1832838803869).
53152325311331 is a wasteful number, since it uses less digits than its factorization.
53152325311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1832838803868.
The product of its digits is 121500, while the sum is 38.
Adding to 53152325311331 its reverse (13311352325135), we get a palindrome (66463677636466).
The spelling of 53152325311331 in words is "fifty-three trillion, one hundred fifty-two billion, three hundred twenty-five million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •