[go: up one dir, main page]

Search a number
-
+
10952031 = 33650677
BaseRepresentation
bin101001110001…
…110101011111
3202121102100210
4221301311133
510300431111
61030423503
7162043056
oct51616537
922542323
1010952031
116200472
123801b93
132365cbc
14165139d
15e650a6
hexa71d5f

10952031 has 4 divisors (see below), whose sum is σ = 14602712. Its totient is φ = 7301352.

The previous prime is 10952009. The next prime is 10952059. The reversal of 10952031 is 13025901.

10952031 is digitally balanced in base 3, 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 not a de Polignac number, because 10952031 - 27 = 10951903 is a prime.

It is a super-2 number, since 2×109520312 = 239893966049922, which contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 210952031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3650680.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 10952031 is about 3309.3852903523. The cubic root of 10952031 is about 222.0742589009.

Adding to 10952031 its reverse (13025901), we get a palindrome (23977932).

The spelling of 10952031 in words is "ten million, nine hundred fifty-two thousand, thirty-one".

Divisors: 1 3 3650677 10952031