Base | Representation |
---|---|
bin | 11111000001010… |
… | …10100010101101 |
3 | 200010122121020120 |
4 | 33200222202231 |
5 | 1013104033401 |
6 | 41453235153 |
7 | 6306562050 |
oct | 1740524255 |
9 | 603577216 |
10 | 260221101 |
11 | 123984a68 |
12 | 73192ab9 |
13 | 41bb0aaa |
14 | 267baa97 |
15 | 17ca2836 |
hex | f82a8ad |
260221101 has 8 divisors (see below), whose sum is σ = 396527424. Its totient is φ = 148697760.
The previous prime is 260221097. The next prime is 260221109. The reversal of 260221101 is 101122062.
260221101 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 260221101 - 22 = 260221097 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260221109) 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, 6195720 + ... + 6195761.
It is an arithmetic number, because the mean of its divisors is an integer number (49565928).
Almost surely, 2260221101 is an apocalyptic number.
260221101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
260221101 is a deficient number, since it is larger than the sum of its proper divisors (136306323).
260221101 is a wasteful number, since it uses less digits than its factorization.
260221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12391491.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 260221101 is about 16131.3700906030. The cubic root of 260221101 is about 638.4312988931.
Adding to 260221101 its reverse (101122062), we get a palindrome (361343163).
The spelling of 260221101 in words is "two hundred sixty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •