Search a number
-
+
63125006941 = 88637122307
BaseRepresentation
bin111010110010100010…
…110010101001011101
320000221021211121101001
4322302202302221131
52013240000210231
644555455550301
74363203464053
oct726242625135
9200837747331
1063125006941
112485346a027
121029852b391
135c4cccc619
1430ab91a1d3
151996c8ab61
hexeb28b2a5d

63125006941 has 4 divisors (see below), whose sum is σ = 63132138112. Its totient is φ = 63117875772.

The previous prime is 63125006897. The next prime is 63125006947. The reversal of 63125006941 is 14960052136.

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 63125006941 - 29 = 63125006429 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 63125006941.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (63125006947) 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, 3552291 + ... + 3570016.

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

Almost surely, 263125006941 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7131170.

The product of its (nonzero) digits is 38880, while the sum is 37.

The spelling of 63125006941 in words is "sixty-three billion, one hundred twenty-five million, six thousand, nine hundred forty-one".

Divisors: 1 8863 7122307 63125006941