Base | Representation |
---|---|
bin | 10111111111010100001010… |
… | …111111100011111010000110 |
3 | 111211120021120110012010020022 |
4 | 113333110022333203322012 |
5 | 102312102400322414200 |
6 | 1012220451340535142 |
7 | 31136363265351215 |
oct | 2777241277437206 |
9 | 454507513163208 |
10 | 105506056060550 |
11 | 3068795a122052 |
12 | b9bb9448514b2 |
13 | 46b4241c21852 |
14 | 1c0a73dc2107c |
15 | c2e6c4632885 |
hex | 5ff50afe3e86 |
105506056060550 has 24 divisors (see below), whose sum is σ = 197540875308432. Its totient is φ = 41922936180000.
The previous prime is 105506056060547. The next prime is 105506056060571. The reversal of 105506056060550 is 55060650605501.
It is a super-3 number, since 3×1055060560605503 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6987148481 + ... + 6987163580.
It is an arithmetic number, because the mean of its divisors is an integer number (8230869804518).
Almost surely, 2105506056060550 is an apocalyptic number.
105506056060550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105506056060550 is a deficient number, since it is larger than the sum of its proper divisors (92034819247882).
105506056060550 is a wasteful number, since it uses less digits than its factorization.
105506056060550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13974312224 (or 13974312219 counting only the distinct ones).
The product of its (nonzero) digits is 675000, while the sum is 44.
The spelling of 105506056060550 in words is "one hundred five trillion, five hundred six billion, fifty-six million, sixty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •