Base | Representation |
---|---|
bin | 11110101110100011011… |
… | …01001001011011111011 |
3 | 10201221011111020021222020 |
4 | 33113101231021123323 |
5 | 114244222011321140 |
6 | 2125004314125523 |
7 | 136164225434226 |
oct | 17272155113373 |
9 | 3657144207866 |
10 | 1055785260795 |
11 | 37783528a011 |
12 | 1507504208a3 |
13 | 787387892b5 |
14 | 391592485bd |
15 | 1c6e3e776d0 |
hex | f5d1b496fb |
1055785260795 has 64 divisors (see below), whose sum is σ = 1807995471360. Its totient is φ = 524506752000.
The previous prime is 1055785260727. The next prime is 1055785260799. The reversal of 1055785260795 is 5970625875501.
It is not a de Polignac number, because 1055785260795 - 217 = 1055785129723 is a prime.
It is a super-2 number, since 2×10557852607952 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (1055785260799) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 53309895 + ... + 53329695.
It is an arithmetic number, because the mean of its divisors is an integer number (28249929240).
Almost surely, 21055785260795 is an apocalyptic number.
1055785260795 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1055785260795 is a deficient number, since it is larger than the sum of its proper divisors (752210210565).
1055785260795 is a wasteful number, since it uses less digits than its factorization.
1055785260795 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22956.
The product of its (nonzero) digits is 26460000, while the sum is 60.
The spelling of 1055785260795 in words is "one trillion, fifty-five billion, seven hundred eighty-five million, two hundred sixty thousand, seven hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •