Search a number
-
+
1055314215201 = 32571368760331
BaseRepresentation
bin11110101101101011010…
…00010000000100100001
310201212221122212200220010
433112311220100010201
5114242240414341301
62124445450035133
7136146445552401
oct17266550200441
93655848780803
101055314215201
113776133a9534
1215063a718aa9
13786920012ac
143911286c801
151c6b792d5d6
hexf5b5a10121

1055314215201 has 8 divisors (see below), whose sum is σ = 1412560662624. Its totient is φ = 700805288960.

The previous prime is 1055314215199. The next prime is 1055314215269. The reversal of 1055314215201 is 1025124135501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1055314215201 - 21 = 1055314215199 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (1055314215281) 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 in 7 ways as a sum of consecutive naturals, for example, 684379395 + ... + 684380936.

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

Almost surely, 21055314215201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1368760591.

The product of its (nonzero) digits is 6000, while the sum is 30.

The spelling of 1055314215201 in words is "one trillion, fifty-five billion, three hundred fourteen million, two hundred fifteen thousand, two hundred one".

Divisors: 1 3 257 771 1368760331 4106280993 351771405067 1055314215201