Base | Representation |
---|---|
bin | 11101111001001111110… |
… | …100011100001000010101 |
3 | 21021101121000221100121010 |
4 | 131321033310130020111 |
5 | 232124233334424021 |
6 | 4211425304442433 |
7 | 301264204520130 |
oct | 35711764341025 |
9 | 7241530840533 |
10 | 2054333514261 |
11 | 722268792286 |
12 | 292188179419 |
13 | 11b952059002 |
14 | 7160494d217 |
15 | 38688026976 |
hex | 1de4fd1c215 |
2054333514261 has 32 divisors (see below), whose sum is σ = 3158622535680. Its totient is φ = 1163347145856.
The previous prime is 2054333514253. The next prime is 2054333514307. The reversal of 2054333514261 is 1624153334502.
It is not a de Polignac number, because 2054333514261 - 23 = 2054333514253 is a prime.
It is a super-2 number, since 2×20543335142612 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2054333514161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1931425 + ... + 2799833.
It is an arithmetic number, because the mean of its divisors is an integer number (98706954240).
Almost surely, 22054333514261 is an apocalyptic number.
2054333514261 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2054333514261 is a deficient number, since it is larger than the sum of its proper divisors (1104289021419).
2054333514261 is a wasteful number, since it uses less digits than its factorization.
2054333514261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 869433.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 2054333514261 its reverse (1624153334502), we get a palindrome (3678486848763).
The spelling of 2054333514261 in words is "two trillion, fifty-four billion, three hundred thirty-three million, five hundred fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •