Base | Representation |
---|---|
bin | 11000000111010011011101… |
… | …100101011011111000100110 |
3 | 111220111202121210020102120210 |
4 | 120013103131211123320212 |
5 | 102400101220303113420 |
6 | 1013321003431240250 |
7 | 31224140002313316 |
oct | 3007233545337046 |
9 | 456452553212523 |
10 | 106055050051110 |
11 | 3087976a9a4836 |
12 | ba8a219819086 |
13 | 4723c43579a84 |
14 | 1c2913dd01446 |
15 | c3db0663d9e0 |
hex | 6074dd95be26 |
106055050051110 has 32 divisors (see below), whose sum is σ = 262742833677312. Its totient is φ = 27369045174240.
The previous prime is 106055050051103. The next prime is 106055050051189. The reversal of 106055050051110 is 11150050550601.
It is a super-2 number, since 2×1060550500511102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57018843184 + ... + 57018845043.
It is an arithmetic number, because the mean of its divisors is an integer number (8210713552416).
Almost surely, 2106055050051110 is an apocalyptic number.
106055050051110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106055050051110 is an abundant number, since it is smaller than the sum of its proper divisors (156687783626202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106055050051110 is a wasteful number, since it uses less digits than its factorization.
106055050051110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114037688268.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 106055050051110 in words is "one hundred six trillion, fifty-five billion, fifty million, fifty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •