Search a number
-
+
10141567201 = 35392865659
BaseRepresentation
bin10010111000111110…
…00000100011100001
3222011210010222211001
421130133000203201
5131232220122301
64354200552001
7506213620213
oct113437004341
928153128731
1010141567201
1143347175a7
121b70482601
13c58125c4c
146c2c945b3
153e5523c01
hex25c7c08e1

10141567201 has 4 divisors (see below), whose sum is σ = 10144436400. Its totient is φ = 10138698004.

The previous prime is 10141567153. The next prime is 10141567217. The reversal of 10141567201 is 10276514101.

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 a cyclic number.

It is not a de Polignac number, because 10141567201 - 213 = 10141559009 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10141567201.

It is not an unprimeable number, because it can be changed into a prime (10141567291) by changing a digit.

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

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

Almost surely, 210141567201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2869198.

The product of its (nonzero) digits is 1680, while the sum is 28.

The spelling of 10141567201 in words is "ten billion, one hundred forty-one million, five hundred sixty-seven thousand, two hundred one".

Divisors: 1 3539 2865659 10141567201