Search a number
-
+
401346546405107 = 1723608620376771
BaseRepresentation
bin101101101000001011100011…
…0010101001000111011110011
31221122001100120212212221102212
41123100113012111020323303
5410101130211334430412
63541332020313402335
7150352221364343012
oct13320270625107363
91848040525787385
10401346546405107
111069771293a9986
123901b7964093ab
13142c3a80a45624
1471173c29a4a79
15315ee28606222
hex16d05c6548ef3

401346546405107 has 4 divisors (see below), whose sum is σ = 424955166781896. Its totient is φ = 377737926028320.

The previous prime is 401346546405089. The next prime is 401346546405109. The reversal of 401346546405107 is 701504645643104.

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 401346546405107 - 28 = 401346546404851 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2401346546405107 is an apocalyptic number.

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

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

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

The sum of its prime factors is 23608620376788.

The product of its (nonzero) digits is 4838400, while the sum is 50.

The spelling of 401346546405107 in words is "four hundred one trillion, three hundred forty-six billion, five hundred forty-six million, four hundred five thousand, one hundred seven".

Divisors: 1 17 23608620376771 401346546405107