Search a number
-
+
10341601535 = 52068320307
BaseRepresentation
bin10011010000110100…
…00101000011111111
3222200201112210100002
421220122011003333
5132134422222120
64430104224515
7514163106536
oct115032050377
928621483302
1010341601535
114427623331
12200746b13b
13c8a6c2a65
1470168531d
15407d88375
hex2686850ff

10341601535 has 4 divisors (see below), whose sum is σ = 12409921848. Its totient is φ = 8273281224.

The previous prime is 10341601531. The next prime is 10341601583. The reversal of 10341601535 is 53510614301.

10341601535 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.

It is a cyclic number.

It is not a de Polignac number, because 10341601535 - 22 = 10341601531 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10341601498 and 10341601507.

It is a congruent number.

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

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

Almost surely, 210341601535 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2068320312.

The product of its (nonzero) digits is 5400, while the sum is 29.

The spelling of 10341601535 in words is "ten billion, three hundred forty-one million, six hundred one thousand, five hundred thirty-five".

Divisors: 1 5 2068320307 10341601535