Base | Representation |
---|---|
bin | 11000000111010100011100… |
… | …100011011110010110110100 |
3 | 111220111212100102010200011002 |
4 | 120013110130203132112310 |
5 | 102400110401231022211 |
6 | 1013321300330502432 |
7 | 31224205121065631 |
oct | 3007243443362664 |
9 | 456455312120132 |
10 | 106056106501556 |
11 | 3087a162274682 |
12 | ba8a473594a18 |
13 | 47240813c0393 |
14 | 1c29200345188 |
15 | c3db6927103b |
hex | 60751c8de5b4 |
106056106501556 has 48 divisors (see below), whose sum is σ = 191120037675840. Its totient is φ = 51464295770880.
The previous prime is 106056106501529. The next prime is 106056106501573. The reversal of 106056106501556 is 655105601650601.
It is a super-2 number, since 2×1060561065015562 (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 106056106501556.
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 15 ways as a sum of consecutive naturals, for example, 43983275 + ... + 46331853.
It is an arithmetic number, because the mean of its divisors is an integer number (3981667451580).
Almost surely, 2106056106501556 is an apocalyptic number.
It is an amenable number.
106056106501556 is a deficient number, since it is larger than the sum of its proper divisors (85063931174284).
106056106501556 is a wasteful number, since it uses less digits than its factorization.
106056106501556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2350064 (or 2350062 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 47.
The spelling of 106056106501556 in words is "one hundred six trillion, fifty-six billion, one hundred six million, five hundred one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •