Base | Representation |
---|---|
bin | 111011001001001010101111… |
… | …100001110001010001011001 |
3 | 1021002222201122110101020222120 |
4 | 323021022233201301101121 |
5 | 233043210004041330341 |
6 | 2321115022441411453 |
7 | 105534446044411344 |
oct | 7311125741612131 |
9 | 1232881573336876 |
10 | 260114754245721 |
11 | 75976058659761 |
12 | 2520bb94a99b89 |
13 | b21a9402abacb |
14 | 483389ab0d45b |
15 | 20112ad2ea066 |
hex | ec92af871459 |
260114754245721 has 8 divisors (see below), whose sum is σ = 365073339292320. Its totient is φ = 164283002681472.
The previous prime is 260114754245713. The next prime is 260114754245743. The reversal of 260114754245721 is 127542457411062.
260114754245721 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 260114754245721 - 23 = 260114754245713 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (260114754245791) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2281708370520 + ... + 2281708370633.
It is an arithmetic number, because the mean of its divisors is an integer number (45634167411540).
Almost surely, 2260114754245721 is an apocalyptic number.
It is an amenable number.
260114754245721 is a deficient number, since it is larger than the sum of its proper divisors (104958585046599).
260114754245721 is a wasteful number, since it uses less digits than its factorization.
260114754245721 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4563416741175.
The product of its (nonzero) digits is 3763200, while the sum is 51.
The spelling of 260114754245721 in words is "two hundred sixty trillion, one hundred fourteen billion, seven hundred fifty-four million, two hundred forty-five thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •