Base | Representation |
---|---|
bin | 111011011100010100110101… |
… | …101011110100111101000111 |
3 | 1021021122120210100200001000122 |
4 | 323130110311223310331013 |
5 | 233231242212321144032 |
6 | 2324003510512332155 |
7 | 106031533313361251 |
oct | 7334246553647507 |
9 | 1237576710601018 |
10 | 261431265021767 |
11 | 76333416673305 |
12 | 253a316984405b |
13 | b2b4b29c183c9 |
14 | 487b4aadc8cd1 |
15 | 20356619ac012 |
hex | edc535af4f47 |
261431265021767 has 4 divisors (see below), whose sum is σ = 261445002167856. Its totient is φ = 261417527875680.
The previous prime is 261431265021709. The next prime is 261431265021769. The reversal of 261431265021767 is 767120562134162.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 261431265021767 - 228 = 261430996586311 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 (261431265021769) 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 3 ways as a sum of consecutive naturals, for example, 6868544498 + ... + 6868582559.
It is an arithmetic number, because the mean of its divisors is an integer number (65361250541964).
Almost surely, 2261431265021767 is an apocalyptic number.
261431265021767 is a deficient number, since it is larger than the sum of its proper divisors (13737146089).
261431265021767 is a wasteful number, since it uses less digits than its factorization.
261431265021767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13737146088.
The product of its (nonzero) digits is 5080320, while the sum is 53.
The spelling of 261431265021767 in words is "two hundred sixty-one trillion, four hundred thirty-one billion, two hundred sixty-five million, twenty-one thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •