Base | Representation |
---|---|
bin | 100111101001000001100… |
… | …111011001110111011111 |
3 | 100122102101220202221210020 |
4 | 213221001213121313133 |
5 | 324112434142124041 |
6 | 5443234445443223 |
7 | 400544662630650 |
oct | 47510147316737 |
9 | 10572356687706 |
10 | 2724110114271 |
11 | 96031a162157 |
12 | 37bb4ab70513 |
13 | 169b61a72a00 |
14 | 95bc1c95527 |
15 | 4acd8a77866 |
hex | 27a419d9ddf |
2724110114271 has 192 divisors, whose sum is σ = 4710472704000. Its totient is φ = 1369730539008.
The previous prime is 2724110114267. The next prime is 2724110114281. The reversal of 2724110114271 is 1724110114272.
It is not a de Polignac number, because 2724110114271 - 22 = 2724110114267 is a prime.
It is a super-2 number, since 2×27241101142712 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2724110114281) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4547762830 + ... + 4547763428.
It is an arithmetic number, because the mean of its divisors is an integer number (24533712000).
Almost surely, 22724110114271 is an apocalyptic number.
2724110114271 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2724110114271 is a deficient number, since it is larger than the sum of its proper divisors (1986362589729).
2724110114271 is a wasteful number, since it uses less digits than its factorization.
2724110114271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1318 (or 1305 counting only the distinct ones).
The product of its (nonzero) digits is 6272, while the sum is 33.
Subtracting from 2724110114271 its reverse (1724110114272), we obtain a palindrome (999999999999).
The spelling of 2724110114271 in words is "two trillion, seven hundred twenty-four billion, one hundred ten million, one hundred fourteen thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •