Search a number
-
+
10146497 = 11039199
BaseRepresentation
bin100110101101…
…001011000001
3201002111101012
4212231023001
510044141442
61001250305
7152146424
oct46551301
921074335
1010146497
115800239
123493995
13214345a
1414c19bb
15d56582
hex9ad2c1

10146497 has 4 divisors (see below), whose sum is σ = 10156800. Its totient is φ = 10136196.

The previous prime is 10146481. The next prime is 10146527. The reversal of 10146497 is 79464101.

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, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 10146497 - 24 = 10146481 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 210146497 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10302.

The product of its (nonzero) digits is 6048, while the sum is 32.

The square root of 10146497 is about 3185.3566519308. The cubic root of 10146497 is about 216.4904336828.

The spelling of 10146497 in words is "ten million, one hundred forty-six thousand, four hundred ninety-seven".

Divisors: 1 1103 9199 10146497