Search a number
-
+
10406505133 is a prime number
BaseRepresentation
bin10011011000100011…
…01010101010101101
3222212020200020100001
421230101222222231
5132303031131013
64440343304301
7515611556053
oct115421525255
928766606301
1010406505133
114460223372
12202514b091
13c9ac9895b
1470a13c1d3
1540d908ddd
hex26c46aaad

10406505133 has 2 divisors, whose sum is σ = 10406505134. Its totient is φ = 10406505132.

The previous prime is 10406505119. The next prime is 10406505169. The reversal of 10406505133 is 33150560401.

10406505133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7928655849 + 2477849284 = 89043^2 + 49778^2 .

It is a cyclic number.

It is not a de Polignac number, because 10406505133 - 25 = 10406505101 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10406505833) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5203252566 + 5203252567.

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

Almost surely, 210406505133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 28.

The spelling of 10406505133 in words is "ten billion, four hundred six million, five hundred five thousand, one hundred thirty-three".