Base | Representation |
---|---|
bin | 111011001101101011010101… |
… | …000110011100000001101011 |
3 | 1021011002100110200201100221021 |
4 | 323031223111012130001223 |
5 | 233113244111244312311 |
6 | 2321513230404353311 |
7 | 105566025625155634 |
oct | 7315532506340153 |
9 | 1234070420640837 |
10 | 260424622260331 |
11 | 75a8550a012431 |
12 | 252600530a5837 |
13 | b240c236657c9 |
14 | 484489465888b |
15 | 2019396e95171 |
hex | ecdad519c06b |
260424622260331 has 16 divisors (see below), whose sum is σ = 265263802712064. Its totient is φ = 255633562354464.
The previous prime is 260424622260311. The next prime is 260424622260367. The reversal of 260424622260331 is 133062226424062.
It is a cyclic number.
It is not a de Polignac number, because 260424622260331 - 227 = 260424488042603 is a prime.
It is a super-2 number, since 2×2604246222603312 (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 (260424622260311) 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, 5403585 + ... + 23453101.
It is an arithmetic number, because the mean of its divisors is an integer number (16578987669504).
Almost surely, 2260424622260331 is an apocalyptic number.
260424622260331 is a deficient number, since it is larger than the sum of its proper divisors (4839180451733).
260424622260331 is a wasteful number, since it uses less digits than its factorization.
260424622260331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18050850.
The product of its (nonzero) digits is 995328, while the sum is 43.
Adding to 260424622260331 its reverse (133062226424062), we get a palindrome (393486848684393).
The spelling of 260424622260331 in words is "two hundred sixty trillion, four hundred twenty-four billion, six hundred twenty-two million, two hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •