Base | Representation |
---|---|
bin | 10000000110001010101… |
… | …111001101001001101011 |
3 | 10220202010101200201012100 |
4 | 100012022233031021223 |
5 | 121110330330204030 |
6 | 2204052343144443 |
7 | 142626015532644 |
oct | 20061257151153 |
9 | 3822111621170 |
10 | 1106134225515 |
11 | 397121a2a460 |
12 | 15a462145123 |
13 | 8040090bc07 |
14 | 3b7740566cb |
15 | 1db8e29e360 |
hex | 1018abcd26b |
1106134225515 has 192 divisors, whose sum is σ = 2136819170304. Its totient is φ = 524880000000.
The previous prime is 1106134225507. The next prime is 1106134225549. The reversal of 1106134225515 is 5155224316011.
1106134225515 is a `hidden beast` number, since 1 + 1 + 0 + 6 + 134 + 2 + 2 + 5 + 515 = 666.
It is not a de Polignac number, because 1106134225515 - 23 = 1106134225507 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1106134225515.
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 191 ways as a sum of consecutive naturals, for example, 2271322602 + ... + 2271323088.
It is an arithmetic number, because the mean of its divisors is an integer number (11129266512).
Almost surely, 21106134225515 is an apocalyptic number.
1106134225515 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1106134225515 is a deficient number, since it is larger than the sum of its proper divisors (1030684944789).
1106134225515 is a wasteful number, since it uses less digits than its factorization.
1106134225515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042 (or 1039 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 1106134225515 in words is "one trillion, one hundred six billion, one hundred thirty-four million, two hundred twenty-five thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •