Base | Representation |
---|---|
bin | 100111111001010100110… |
… | …111101010100011100111 |
3 | 100201002120201120100100222 |
4 | 213321110313222203213 |
5 | 324404310412410343 |
6 | 5455251333354555 |
7 | 402034504051610 |
oct | 47712467524347 |
9 | 10632521510328 |
10 | 2741613013223 |
11 | 9677910881a7 |
12 | 383414798a5b |
13 | 16b6c0cc4856 |
14 | 969a2682c07 |
15 | 4b4b048ba68 |
hex | 27e54dea8e7 |
2741613013223 has 8 divisors (see below), whose sum is σ = 3317582133792. Its totient is φ = 2211721422336.
The previous prime is 2741613013187. The next prime is 2741613013241. The reversal of 2741613013223 is 3223103161472.
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 2741613013223 - 240 = 1642101385447 is a prime.
It is a super-5 number, since 5×27416130132235 (a number of 63 digits) contains 55555 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2741613013273) 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, 11519382290 + ... + 11519382527.
It is an arithmetic number, because the mean of its divisors is an integer number (414697766724).
Almost surely, 22741613013223 is an apocalyptic number.
2741613013223 is a deficient number, since it is larger than the sum of its proper divisors (575969120569).
2741613013223 is a wasteful number, since it uses less digits than its factorization.
2741613013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23038764841.
The product of its (nonzero) digits is 36288, while the sum is 35.
Adding to 2741613013223 its reverse (3223103161472), we get a palindrome (5964716174695).
The spelling of 2741613013223 in words is "two trillion, seven hundred forty-one billion, six hundred thirteen million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •