Search a number
-
+
10154013 = 33384671
BaseRepresentation
bin100110101111…
…000000011101
3201002212200120
4212233000131
510044412023
61001345153
7152210352
oct46570035
921085616
1010154013
115805951
1234981b9
1321469bc
1414c4629
15d588e3
hex9af01d

10154013 has 4 divisors (see below), whose sum is σ = 13538688. Its totient is φ = 6769340.

The previous prime is 10153993. The next prime is 10154047. The reversal of 10154013 is 31045101.

10154013 is digitally balanced in base 2 and base 4, because in such bases 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 a cyclic number.

It is not a de Polignac number, because 10154013 - 29 = 10153501 is a prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 210154013 is an apocalyptic number.

It is an amenable number.

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

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

10154013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3384674.

The product of its (nonzero) digits is 60, while the sum is 15.

The square root of 10154013 is about 3186.5362072319. The cubic root of 10154013 is about 216.5438754600.

Adding to 10154013 its reverse (31045101), we get a palindrome (41199114).

The spelling of 10154013 in words is "ten million, one hundred fifty-four thousand, thirteen".

Divisors: 1 3 3384671 10154013