Base | Representation |
---|---|
bin | 10000010111110000100… |
… | …110010111001100001011 |
3 | 10222112212210100112201000 |
4 | 100113300212113030023 |
5 | 121413021400140210 |
6 | 2220454540230043 |
7 | 144165056110353 |
oct | 20276046271413 |
9 | 3875783315630 |
10 | 1125023052555 |
11 | 3a4135202816 |
12 | 162053b3b323 |
13 | 8212102344c |
14 | 3c646931b63 |
15 | 1e3e76c8ac0 |
hex | 105f099730b |
1125023052555 has 16 divisors (see below), whose sum is σ = 2000040982560. Its totient is φ = 600012294624.
The previous prime is 1125023052509. The next prime is 1125023052583. The reversal of 1125023052555 is 5552503205211.
1125023052555 is a `hidden beast` number, since 1 + 1 + 2 + 50 + 2 + 3 + 0 + 52 + 555 = 666.
It is not a de Polignac number, because 1125023052555 - 211 = 1125023050507 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4166751912 + ... + 4166752181.
It is an arithmetic number, because the mean of its divisors is an integer number (125002561410).
Almost surely, 21125023052555 is an apocalyptic number.
1125023052555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1125023052555 is a deficient number, since it is larger than the sum of its proper divisors (875017930005).
1125023052555 is an equidigital number, since it uses as much as digits as its factorization.
1125023052555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8333504107 (or 8333504101 counting only the distinct ones).
The product of its (nonzero) digits is 75000, while the sum is 36.
Adding to 1125023052555 its reverse (5552503205211), we get a palindrome (6677526257766).
The spelling of 1125023052555 in words is "one trillion, one hundred twenty-five billion, twenty-three million, fifty-two thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •