Base | Representation |
---|---|
bin | 111110101011000111101101… |
… | …100001110010001101110111 |
3 | 1100010222010102222002011210102 |
4 | 332223013231201302031313 |
5 | 242112110010402241043 |
6 | 2414124122210544315 |
7 | 112026325141064300 |
oct | 7653075541621567 |
9 | 1303863388064712 |
10 | 275642101212023 |
11 | 7a912182183227 |
12 | 26ab9351b9809b |
13 | baa5c28190300 |
14 | 4c0d2127677a7 |
15 | 21d013c3126b8 |
hex | fab1ed872377 |
275642101212023 has 144 divisors (see below), whose sum is σ = 357062768244000. Its totient is φ = 211985865262080.
The previous prime is 275642101212011. The next prime is 275642101212031. The reversal of 275642101212023 is 320212101246572.
It is not a de Polignac number, because 275642101212023 - 214 = 275642101195639 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (275642101212043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 21369254828 + ... + 21369267726.
It is an arithmetic number, because the mean of its divisors is an integer number (2479602557250).
Almost surely, 2275642101212023 is an apocalyptic number.
275642101212023 is a deficient number, since it is larger than the sum of its proper divisors (81420667031977).
275642101212023 is a wasteful number, since it uses less digits than its factorization.
275642101212023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13442 (or 13422 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 38.
Adding to 275642101212023 its reverse (320212101246572), we get a palindrome (595854202458595).
The spelling of 275642101212023 in words is "two hundred seventy-five trillion, six hundred forty-two billion, one hundred one million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •