Search a number
-
+
10406302371 = 3283127710909
BaseRepresentation
bin10011011000100001…
…11001001010100011
3222212020021221012100
421230100321022203
5132303003133441
64440335101443
7515610052653
oct115420711243
928766257170
1010406302371
1144600a4aa3
122025071883
13c9ac2758a
1470a0c8363
1540d8b8cb6
hex26c4392a3

10406302371 has 24 divisors (see below), whose sum is σ = 15225734160. Its totient is φ = 6847955136.

The previous prime is 10406302349. The next prime is 10406302409. The reversal of 10406302371 is 17320360401.

10406302371 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 630 + 23 + 7 + 1 = 666.

It is not a de Polignac number, because 10406302371 - 25 = 10406302339 is a prime.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 948465 + ... + 959373.

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

Almost surely, 210406302371 is an apocalyptic number.

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

10406302371 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 12275 (or 12272 counting only the distinct ones).

The product of its (nonzero) digits is 3024, while the sum is 27.

Adding to 10406302371 its reverse (17320360401), we get a palindrome (27726662772).

The spelling of 10406302371 in words is "ten billion, four hundred six million, three hundred two thousand, three hundred seventy-one".

Divisors: 1 3 9 83 249 747 1277 3831 10909 11493 32727 98181 105991 317973 905447 953919 2716341 8149023 13930793 41792379 125377137 1156255819 3468767457 10406302371