Search a number
-
+
1055632365501 = 37371358600213
BaseRepresentation
bin11110101110010001001…
…01111001011110111101
310201220202211112102001120
433113020211321132331
5114243413341144001
62124541213101153
7136160361025320
oct17271045713675
93656684472046
101055632365501
11377766a4a56a
121507091877b9
1378712bb55cc
1439142c087b7
151c6d5825236
hexf5c89797bd

1055632365501 has 16 divisors (see below), whose sum is σ = 1652057860224. Its totient is φ = 586915291584.

The previous prime is 1055632365493. The next prime is 1055632365677.

1055632365501 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 1055632365501 - 23 = 1055632365493 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 679299330 + ... + 679300883.

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

Almost surely, 21055632365501 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1358600260.

The product of its (nonzero) digits is 405000, while the sum is 42.

The spelling of 1055632365501 in words is "one trillion, fifty-five billion, six hundred thirty-two million, three hundred sixty-five thousand, five hundred one".

Divisors: 1 3 7 21 37 111 259 777 1358600213 4075800639 9510201491 28530604473 50268207881 150804623643 351877455167 1055632365501