Base | Representation |
---|---|
bin | 11000001110101110110111… |
… | …101010101101000001101100 |
3 | 111222022120012222002221020101 |
4 | 120032232313222231001230 |
5 | 102431432133320143220 |
6 | 1014351304411000444 |
7 | 31306050542661505 |
oct | 3016566752550154 |
9 | 458276188087211 |
10 | 106565515006060 |
11 | 30a561aa077830 |
12 | bb5113b439124 |
13 | 4760114819986 |
14 | 1c45b26d19bac |
15 | c4c030d7430a |
hex | 60ebb7aad06c |
106565515006060 has 96 divisors (see below), whose sum is σ = 254362338478080. Its totient is φ = 37150583539200.
The previous prime is 106565515006051. The next prime is 106565515006079. The reversal of 106565515006060 is 60600515565601.
It is a super-2 number, since 2×1065655150060602 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106565515006060.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 72286345 + ... + 73745824.
It is an arithmetic number, because the mean of its divisors is an integer number (2649607692480).
Almost surely, 2106565515006060 is an apocalyptic number.
106565515006060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106565515006060 is an abundant number, since it is smaller than the sum of its proper divisors (147796823472020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106565515006060 is a wasteful number, since it uses less digits than its factorization.
106565515006060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146032327 (or 146032325 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 46.
The spelling of 106565515006060 in words is "one hundred six trillion, five hundred sixty-five billion, five hundred fifteen million, six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •