Base | Representation |
---|---|
bin | 101000000011111011111… |
… | …010100011011010010101 |
3 | 100202011222200112122022122 |
4 | 220003323322203122111 |
5 | 330101123402000203 |
6 | 5504414022105325 |
7 | 402620020435124 |
oct | 50037372433225 |
9 | 10664880478278 |
10 | 2753005500053 |
11 | 9715a791a176 |
12 | 385673b7b245 |
13 | 16c7b832cb13 |
14 | 9736371dabb |
15 | 4b92a708538 |
hex | 280fbea3695 |
2753005500053 has 8 divisors (see below), whose sum is σ = 2804976093528. Its totient is φ = 2701035910144.
The previous prime is 2753005500001. The next prime is 2753005500067. The reversal of 2753005500053 is 3500055003572.
It can be written as a sum of positive squares in 4 ways, for example, as 1458739775089 + 1294265724964 = 1207783^2 + 1137658^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 2753005500053 - 236 = 2684286023317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2753005499986 and 2753005500022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2753007500053) 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, 7561901 + ... + 7917597.
It is an arithmetic number, because the mean of its divisors is an integer number (350622011691).
Almost surely, 22753005500053 is an apocalyptic number.
It is an amenable number.
2753005500053 is a deficient number, since it is larger than the sum of its proper divisors (51970593475).
2753005500053 is a wasteful number, since it uses less digits than its factorization.
2753005500053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501783.
The product of its (nonzero) digits is 78750, while the sum is 35.
The spelling of 2753005500053 in words is "two trillion, seven hundred fifty-three billion, five million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •