Base | Representation |
---|---|
bin | 1100000101111… |
… | …01101100000101 |
3 | 21001212200212201 |
4 | 12002331230011 |
5 | 201432042021 |
6 | 14022114501 |
7 | 2341141126 |
oct | 602755405 |
9 | 231780781 |
10 | 101440261 |
11 | 5229562a |
12 | 29b7ba31 |
13 | 18029230 |
14 | d68804d |
15 | 8d8b591 |
hex | 60bdb05 |
101440261 has 4 divisors (see below), whose sum is σ = 109243372. Its totient is φ = 93637152.
The previous prime is 101440253. The next prime is 101440267. The reversal of 101440261 is 162044101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 62315236 + 39125025 = 7894^2 + 6255^2 .
It is a cyclic number.
It is not a de Polignac number, because 101440261 - 23 = 101440253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101440267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3901536 + ... + 3901561.
It is an arithmetic number, because the mean of its divisors is an integer number (27310843).
Almost surely, 2101440261 is an apocalyptic number.
It is an amenable number.
101440261 is a deficient number, since it is larger than the sum of its proper divisors (7803111).
101440261 is an equidigital number, since it uses as much as digits as its factorization.
101440261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7803110.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 101440261 is about 10071.7556066457. The cubic root of 101440261 is about 466.3766365089.
Adding to 101440261 its reverse (162044101), we get a palindrome (263484362).
The spelling of 101440261 in words is "one hundred one million, four hundred forty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •