Base | Representation |
---|---|
bin | 11110101101110011011… |
… | …10011010011110101101 |
3 | 10201220010110012020222221 |
4 | 33112321232122132231 |
5 | 114242411013031230 |
6 | 2124500343035341 |
7 | 136151241654103 |
oct | 17267156323655 |
9 | 3656113166887 |
10 | 1055382939565 |
11 | 377649179129 |
12 | 15065973bb51 |
13 | 786a33142b6 |
14 | 3911ba3bc73 |
15 | 1c6bd9a627a |
hex | f5b9b9a7ad |
1055382939565 has 8 divisors (see below), whose sum is σ = 1287221159448. Its totient is φ = 830465263680.
The previous prime is 1055382939539. The next prime is 1055382939581. The reversal of 1055382939565 is 5659392835501.
It can be written as a sum of positive squares in 4 ways, for example, as 22813987849 + 1032568951716 = 151043^2 + 1016154^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055382939565 - 213 = 1055382931373 is a prime.
It is a super-2 number, since 2×10553829395652 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (61).
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1730135662 + ... + 1730136271.
It is an arithmetic number, because the mean of its divisors is an integer number (160902644931).
Almost surely, 21055382939565 is an apocalyptic number.
It is an amenable number.
1055382939565 is a deficient number, since it is larger than the sum of its proper divisors (231838219883).
1055382939565 is an equidigital number, since it uses as much as digits as its factorization.
1055382939565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3460271999.
The product of its (nonzero) digits is 43740000, while the sum is 61.
The spelling of 1055382939565 in words is "one trillion, fifty-five billion, three hundred eighty-two million, nine hundred thirty-nine thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •