Search a number
-
+
10264567413 = 33421522471
BaseRepresentation
bin10011000111101000…
…01101111001110101
3222111100121001101110
421203310031321311
5132010212124123
64414313145233
7512236245342
oct114364157165
928440531343
1010264567413
114398098471
121ba56bb219
13c77760639
146d53517c9
1540121d493
hex263d0de75

10264567413 has 4 divisors (see below), whose sum is σ = 13686089888. Its totient is φ = 6843044940.

The previous prime is 10264567403. The next prime is 10264567427. The reversal of 10264567413 is 31476546201.

It is a happy number.

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 10264567413 - 26 = 10264567349 is a prime.

It is a super-2 number, since 2×102645674132 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 210264567413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3421522474.

The product of its (nonzero) digits is 120960, while the sum is 39.

The spelling of 10264567413 in words is "ten billion, two hundred sixty-four million, five hundred sixty-seven thousand, four hundred thirteen".

Divisors: 1 3 3421522471 10264567413