Base | Representation |
---|---|
bin | 11110101101010010001… |
… | …11000111100110011101 |
3 | 10201212102000200222112120 |
4 | 33112221013013212131 |
5 | 114241323134000130 |
6 | 2124412544453153 |
7 | 136141315515405 |
oct | 17265107074635 |
9 | 3655360628476 |
10 | 1055104203165 |
11 | 3775158a8371 |
12 | 1505a031a1b9 |
13 | 7865a64cb0c |
14 | 390d2a01805 |
15 | 1c6a4297910 |
hex | f5a91c799d |
1055104203165 has 32 divisors (see below), whose sum is σ = 1689500712960. Its totient is φ = 562277792256.
The previous prime is 1055104203157. The next prime is 1055104203203. The reversal of 1055104203165 is 5613024015501.
It is not a de Polignac number, because 1055104203165 - 23 = 1055104203157 is a prime.
It is a super-2 number, since 2×10551042031652 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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, 171754084 + ... + 171760226.
It is an arithmetic number, because the mean of its divisors is an integer number (52796897280).
Almost surely, 21055104203165 is an apocalyptic number.
1055104203165 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1055104203165 is a deficient number, since it is larger than the sum of its proper divisors (634396509795).
1055104203165 is a wasteful number, since it uses less digits than its factorization.
1055104203165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13333.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 1055104203165 its reverse (5613024015501), we get a palindrome (6668128218666).
The spelling of 1055104203165 in words is "one trillion, fifty-five billion, one hundred four million, two hundred three thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •