Base | Representation |
---|---|
bin | 101100000111010011100… |
… | …011010101101010110101 |
3 | 101201210211112100001011012 |
4 | 230013103203111222311 |
5 | 344132003301400203 |
6 | 10240352531322005 |
7 | 432006266016344 |
oct | 54072343255265 |
9 | 11653745301135 |
10 | 3031501200053 |
11 | a6971a43a607 |
12 | 40b637750305 |
13 | 18cb3bc17551 |
14 | a6a22877b5b |
15 | 53cca052bd8 |
hex | 2c1d38d5ab5 |
3031501200053 has 8 divisors (see below), whose sum is σ = 3039404525976. Its totient is φ = 3023606361600.
The previous prime is 3031501200043. The next prime is 3031501200059. The reversal of 3031501200053 is 3500021051303.
It can be written as a sum of positive squares in 4 ways, for example, as 902942754289 + 2128558445764 = 950233^2 + 1458958^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3031501200053 - 222 = 3031497005749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031501200059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1406276 + ... + 2835597.
It is an arithmetic number, because the mean of its divisors is an integer number (379925565747).
Almost surely, 23031501200053 is an apocalyptic number.
It is an amenable number.
3031501200053 is a deficient number, since it is larger than the sum of its proper divisors (7903325923).
3031501200053 is a wasteful number, since it uses less digits than its factorization.
3031501200053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4243735.
The product of its (nonzero) digits is 1350, while the sum is 23.
Adding to 3031501200053 its reverse (3500021051303), we get a palindrome (6531522251356).
The spelling of 3031501200053 in words is "three trillion, thirty-one billion, five hundred one million, two hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •