Base | Representation |
---|---|
bin | 11110101110010001001… |
… | …01111001011110111101 |
3 | 10201220202211112102001120 |
4 | 33113020211321132331 |
5 | 114243413341144001 |
6 | 2124541213101153 |
7 | 136160361025320 |
oct | 17271045713675 |
9 | 3656684472046 |
10 | 1055632365501 |
11 | 377766a4a56a |
12 | 1507091877b9 |
13 | 78712bb55cc |
14 | 39142c087b7 |
15 | 1c6d5825236 |
hex | f5c89797bd |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •