Base | Representation |
---|---|
bin | 100001001000111011101… |
… | …011111011110111110101 |
3 | 22001201012022202210221011 |
4 | 201020323223323313311 |
5 | 244302440003240203 |
6 | 4502105351552221 |
7 | 323350313643502 |
oct | 41107353736765 |
9 | 8051168683834 |
10 | 2277334040053 |
11 | 7a88a2771986 |
12 | 30944268b671 |
13 | 1369a058c757 |
14 | 7c31b6184a9 |
15 | 3e38a86176d |
hex | 2123bafbdf5 |
2277334040053 has 8 divisors (see below), whose sum is σ = 2284480754496. Its totient is φ = 2270188932000.
The previous prime is 2277334040027. The next prime is 2277334040071. The reversal of 2277334040053 is 3500404337722.
It is a happy number.
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 2277334040053 - 233 = 2268744105461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2277334039988 and 2277334040015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2277334041053) 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, 2470353 + ... + 3264553.
It is an arithmetic number, because the mean of its divisors is an integer number (285560094312).
Almost surely, 22277334040053 is an apocalyptic number.
It is an amenable number.
2277334040053 is a deficient number, since it is larger than the sum of its proper divisors (7146714443).
2277334040053 is an equidigital number, since it uses as much as digits as its factorization.
2277334040053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 803195.
The product of its (nonzero) digits is 423360, while the sum is 40.
Adding to 2277334040053 its reverse (3500404337722), we get a palindrome (5777738377775).
The spelling of 2277334040053 in words is "two trillion, two hundred seventy-seven billion, three hundred thirty-four million, forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •