Base | Representation |
---|---|
bin | 1111001010100011010… |
… | …1101100100001100011 |
3 | 220220110211110010122120 |
4 | 3302220311230201203 |
5 | 13232031323423201 |
6 | 315404112435323 |
7 | 24552123202236 |
oct | 3625065544143 |
9 | 826424403576 |
10 | 260530686051 |
11 | a0543864579 |
12 | 425ab248b43 |
13 | 1b74c9b677c |
14 | c87723741d |
15 | 6b9c5a2536 |
hex | 3ca8d6c863 |
260530686051 has 4 divisors (see below), whose sum is σ = 347374248072. Its totient is φ = 173687124032.
The previous prime is 260530686029. The next prime is 260530686067. The reversal of 260530686051 is 150686035062.
It is a happy number.
260530686051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 260530686051 - 25 = 260530686019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 260530685994 and 260530686012.
It is not an unprimeable number, because it can be changed into a prime (260530681051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43421781006 + ... + 43421781011.
It is an arithmetic number, because the mean of its divisors is an integer number (86843562018).
Almost surely, 2260530686051 is an apocalyptic number.
260530686051 is a deficient number, since it is larger than the sum of its proper divisors (86843562021).
260530686051 is an equidigital number, since it uses as much as digits as its factorization.
260530686051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86843562020.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 260530686051 in words is "two hundred sixty billion, five hundred thirty million, six hundred eighty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •