Search a number
-
+
10141446261 = 33380482087
BaseRepresentation
bin10010111000111101…
…00011000001110101
3222011202220211220210
421130132203001311
5131232202240021
64354154220033
7506212604502
oct113436430165
928152824823
1010141446261
114334644751
121b70424619
13c580b2b9b
146c2c624a9
153e54ece76
hex25c7a3075

10141446261 has 4 divisors (see below), whose sum is σ = 13521928352. Its totient is φ = 6760964172.

The previous prime is 10141446257. The next prime is 10141446283. The reversal of 10141446261 is 16264414101.

10141446261 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10141446261 - 22 = 10141446257 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 (10141446961) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1690241041 + ... + 1690241046.

It is an arithmetic number, because the mean of its divisors is an integer number (3380482088).

Almost surely, 210141446261 is an apocalyptic number.

It is an amenable number.

10141446261 is a deficient number, since it is larger than the sum of its proper divisors (3380482091).

10141446261 is an equidigital number, since it uses as much as digits as its factorization.

10141446261 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 3380482090.

The product of its (nonzero) digits is 4608, while the sum is 30.

The spelling of 10141446261 in words is "ten billion, one hundred forty-one million, four hundred forty-six thousand, two hundred sixty-one".

Divisors: 1 3 3380482087 10141446261