Base | Representation |
---|---|
bin | 111011011111011100111100… |
… | …011101110001010010000111 |
3 | 1021022102010101110122122202102 |
4 | 323133130330131301102013 |
5 | 233243302232022021043 |
6 | 2324250323233302315 |
7 | 106053210641305031 |
oct | 7337347435612207 |
9 | 1238363343578672 |
10 | 261646127142023 |
11 | 76406554742418 |
12 | 2541893270499b |
13 | b2cc17c339380 |
14 | 4887a50c7cc51 |
15 | 203b039aac6b8 |
hex | edf73c771487 |
261646127142023 has 16 divisors (see below), whose sum is σ = 285446648632320. Its totient is φ = 238372744113504.
The previous prime is 261646127142017. The next prime is 261646127142041. The reversal of 261646127142023 is 320241721646162.
It is not a de Polignac number, because 261646127142023 - 28 = 261646127141767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (261646127142013) 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 15 ways as a sum of consecutive naturals, for example, 45099761 + ... + 50569562.
It is an arithmetic number, because the mean of its divisors is an integer number (17840415539520).
Almost surely, 2261646127142023 is an apocalyptic number.
261646127142023 is a deficient number, since it is larger than the sum of its proper divisors (23800521490297).
261646127142023 is a wasteful number, since it uses less digits than its factorization.
261646127142023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95672078.
The product of its (nonzero) digits is 1161216, while the sum is 47.
Adding to 261646127142023 its reverse (320241721646162), we get a palindrome (581887848788185).
The spelling of 261646127142023 in words is "two hundred sixty-one trillion, six hundred forty-six billion, one hundred twenty-seven million, one hundred forty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •