Base | Representation |
---|---|
bin | 101000000011111101011… |
… | …001111011100110010101 |
3 | 100202012001102120220122111 |
4 | 220003331121323212111 |
5 | 330101201302042210 |
6 | 5504420314031021 |
7 | 402620443111342 |
oct | 50037531734625 |
9 | 10665042526574 |
10 | 2753030502805 |
11 | 97160aa47100 |
12 | 385680418471 |
13 | 16c7c057534b |
14 | 97366b8b7c9 |
15 | 4b92c9e688a |
hex | 280fd67b995 |
2753030502805 has 24 divisors (see below), whose sum is σ = 3631999797216. Its totient is φ = 2001801600480.
The previous prime is 2753030502791. The next prime is 2753030502811. The reversal of 2753030502805 is 5082050303572.
2753030502805 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2753030502805 - 223 = 2753022114197 is a prime.
It is a super-2 number, since 2×27530305028052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2572042 + ... + 3481588.
It is an arithmetic number, because the mean of its divisors is an integer number (151333324884).
Almost surely, 22753030502805 is an apocalyptic number.
It is an amenable number.
2753030502805 is a deficient number, since it is larger than the sum of its proper divisors (878969294411).
2753030502805 is a wasteful number, since it uses less digits than its factorization.
2753030502805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914577 (or 914566 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 40.
The spelling of 2753030502805 in words is "two trillion, seven hundred fifty-three billion, thirty million, five hundred two thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •