Base | Representation |
---|---|
bin | 10110111111010010010110… |
… | …100011100011011101111000 |
3 | 111020222122101212220112121001 |
4 | 112333102112203203131320 |
5 | 101223010200322104202 |
6 | 555011251514254344 |
7 | 30203446215352660 |
oct | 2677222643433570 |
9 | 436878355815531 |
10 | 101106056050552 |
11 | 2a2409238a1623 |
12 | b40b0457273b4 |
13 | 445534c7b3387 |
14 | 1ad77b87191a0 |
15 | ba5001c7ad87 |
hex | 5bf4968e3778 |
101106056050552 has 64 divisors (see below), whose sum is σ = 217955148387840. Its totient is φ = 43071909148800.
The previous prime is 101106056050541. The next prime is 101106056050553. The reversal of 101106056050552 is 255050650601101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101106056050553) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1718902 + ... + 14323642.
It is an arithmetic number, because the mean of its divisors is an integer number (3405549193560).
Almost surely, 2101106056050552 is an apocalyptic number.
It is an amenable number.
101106056050552 is an abundant number, since it is smaller than the sum of its proper divisors (116849092337288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101106056050552 is a wasteful number, since it uses less digits than its factorization.
101106056050552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12605612 (or 12605608 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 37.
The spelling of 101106056050552 in words is "one hundred one trillion, one hundred six billion, fifty-six million, fifty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •