Base | Representation |
---|---|
bin | 11110101101010101010… |
… | …10001111000110110101 |
3 | 10201212110211121001111220 |
4 | 33112222222033012311 |
5 | 114241401311424130 |
6 | 2124415313420553 |
7 | 136142052413526 |
oct | 17265252170665 |
9 | 3655424531456 |
10 | 1055130186165 |
11 | 377529534820 |
12 | 1505a8b6a759 |
13 | 78662b49583 |
14 | 390d624684d |
15 | 1c6a66cb410 |
hex | f5aaa8f1b5 |
1055130186165 has 32 divisors (see below), whose sum is σ = 1841792919552. Its totient is φ = 511547400000.
The previous prime is 1055130186161. The next prime is 1055130186179. The reversal of 1055130186165 is 5616810315501.
It is not a de Polignac number, because 1055130186165 - 22 = 1055130186161 is a prime.
It is a super-2 number, since 2×10551301861652 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055130186161) 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 31 ways as a sum of consecutive naturals, for example, 2678640 + ... + 3047190.
It is an arithmetic number, because the mean of its divisors is an integer number (57556028736).
Almost surely, 21055130186165 is an apocalyptic number.
1055130186165 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1055130186165 is a deficient number, since it is larger than the sum of its proper divisors (786662733387).
1055130186165 is a wasteful number, since it uses less digits than its factorization.
1055130186165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385921.
The product of its (nonzero) digits is 108000, while the sum is 42.
The spelling of 1055130186165 in words is "one trillion, fifty-five billion, one hundred thirty million, one hundred eighty-six thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •