Base | Representation |
---|---|
bin | 111011011100100110101000… |
… | …100001110101011100000011 |
3 | 1021021201102002221011101102110 |
4 | 323130212220201311130003 |
5 | 233232100330120320311 |
6 | 2324020350445550403 |
7 | 106033110640140522 |
oct | 7334465041653403 |
9 | 1237642087141373 |
10 | 261450371651331 |
11 | 76340530888955 |
12 | 253a6a00575403 |
13 | b2b68834ab085 |
14 | 487c3a079c4b9 |
15 | 2035dce0aa8a6 |
hex | edc9a8875703 |
261450371651331 has 16 divisors (see below), whose sum is σ = 349221518442368. Its totient is φ = 173989754697600.
The previous prime is 261450371651327. The next prime is 261450371651377. The reversal of 261450371651331 is 133156173054162.
261450371651331 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 261450371651331 - 22 = 261450371651327 is a prime.
It is a super-2 number, since 2×2614503716513312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (261450371650331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55030896 + ... + 59592786.
It is an arithmetic number, because the mean of its divisors is an integer number (21826344902648).
Almost surely, 2261450371651331 is an apocalyptic number.
261450371651331 is a deficient number, since it is larger than the sum of its proper divisors (87771146791037).
261450371651331 is a wasteful number, since it uses less digits than its factorization.
261450371651331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4595922.
The product of its (nonzero) digits is 1360800, while the sum is 48.
The spelling of 261450371651331 in words is "two hundred sixty-one trillion, four hundred fifty billion, three hundred seventy-one million, six hundred fifty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •