Base | Representation |
---|---|
bin | 11110101110001011000… |
… | …00101011100111100111 |
3 | 10201220122020020211010221 |
4 | 33113011200223213213 |
5 | 114243312122310333 |
6 | 2124532125025211 |
7 | 136156162423030 |
oct | 17270540534747 |
9 | 3656566224127 |
10 | 1055580666343 |
11 | 37773a849195 |
12 | 1506b39b5207 |
13 | 787052839a8 |
14 | 39139dcba87 |
15 | 1c6d1011d2d |
hex | f5c582b9e7 |
1055580666343 has 4 divisors (see below), whose sum is σ = 1206377904400. Its totient is φ = 904783428288.
The previous prime is 1055580666331. The next prime is 1055580666353. The reversal of 1055580666343 is 3436660855501.
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 1055580666343 - 229 = 1055043795431 is a prime.
It is a super-2 number, since 2×10555806663432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055580666353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75398619018 + ... + 75398619031.
It is an arithmetic number, because the mean of its divisors is an integer number (301594476100).
Almost surely, 21055580666343 is an apocalyptic number.
1055580666343 is a deficient number, since it is larger than the sum of its proper divisors (150797238057).
1055580666343 is an equidigital number, since it uses as much as digits as its factorization.
1055580666343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150797238056.
The product of its (nonzero) digits is 7776000, while the sum is 52.
The spelling of 1055580666343 in words is "one trillion, fifty-five billion, five hundred eighty million, six hundred sixty-six thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •