Base | Representation |
---|---|
bin | 110001100110011011… |
… | …0110000100111000010 |
3 | 101011221021212122021102 |
4 | 1203030312300213002 |
5 | 3221121111401200 |
6 | 120533254054402 |
7 | 10460366045612 |
oct | 1431466604702 |
9 | 334837778242 |
10 | 106516122050 |
11 | 4119a635038 |
12 | 1878804a402 |
13 | a0767b6870 |
14 | 5226620a42 |
15 | 2b863226d5 |
hex | 18ccdb09c2 |
106516122050 has 48 divisors (see below), whose sum is σ = 213555909672. Its totient is φ = 39292915200.
The previous prime is 106516122049. The next prime is 106516122073. The reversal of 106516122050 is 50221615601.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 6450820489 + 100065301561 = 80317^2 + 316331^2 .
It is a super-2 number, since 2×1065161220502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 638360 + ... + 787740.
Almost surely, 2106516122050 is an apocalyptic number.
106516122050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106516122050 is an abundant number, since it is smaller than the sum of its proper divisors (107039787622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106516122050 is a wasteful number, since it uses less digits than its factorization.
106516122050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150503 (or 150498 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 106516122050 its reverse (50221615601), we get a palindrome (156737737651).
The spelling of 106516122050 in words is "one hundred six billion, five hundred sixteen million, one hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •