Base | Representation |
---|---|
bin | 101101100111101101110… |
… | …000011101110100110101 |
3 | 102002201000221100012100012 |
4 | 231213231300131310311 |
5 | 402331010114022203 |
6 | 10400113000030005 |
7 | 442332501602513 |
oct | 55475560356465 |
9 | 12081027305305 |
10 | 3135020064053 |
11 | aa9611107279 |
12 | 427707a62305 |
13 | 199828769927 |
14 | aba42da74b3 |
15 | 56838173bd8 |
hex | 2d9edc1dd35 |
3135020064053 has 4 divisors (see below), whose sum is σ = 3139910891628. Its totient is φ = 3130129236480.
The previous prime is 3135020064047. The next prime is 3135020064073. The reversal of 3135020064053 is 3504600205313.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1693116235204 + 1441903828849 = 1301198^2 + 1200793^2 .
It is a cyclic number.
It is not a de Polignac number, because 3135020064053 - 220 = 3135019015477 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 (3135020064073) 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, 2445412826 + ... + 2445414107.
It is an arithmetic number, because the mean of its divisors is an integer number (784977722907).
Almost surely, 23135020064053 is an apocalyptic number.
It is an amenable number.
3135020064053 is a deficient number, since it is larger than the sum of its proper divisors (4890827575).
3135020064053 is an equidigital number, since it uses as much as digits as its factorization.
3135020064053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4890827574.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 3135020064053 its reverse (3504600205313), we get a palindrome (6639620269366).
The spelling of 3135020064053 in words is "three trillion, one hundred thirty-five billion, twenty million, sixty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •