Base | Representation |
---|---|
bin | 11000000111010100011100… |
… | …110100110100110100010000 |
3 | 111220111212100201200202102222 |
4 | 120013110130310310310100 |
5 | 102400110403412100000 |
6 | 1013321301012200212 |
7 | 31224205204541456 |
oct | 3007243464646420 |
9 | 456455321622388 |
10 | 106056111050000 |
11 | 3087a1648a0a21 |
12 | ba8a475009068 |
13 | 4724082323777 |
14 | 1c29200baa9d6 |
15 | c3db6986da85 |
hex | 60751cd34d10 |
106056111050000 has 60 divisors (see below), whose sum is σ = 256838205373092. Its totient is φ = 42422444400000.
The previous prime is 106056111049957. The next prime is 106056111050161. The reversal of 106056111050000 is 50111650601.
It can be written as a sum of positive squares in 6 ways, for example, as 102432859711744 + 3623251338256 = 10120912^2 + 1903484^2 .
It is a super-2 number, since 2×1060561110500002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1060511111 + ... + 1060611110.
Almost surely, 2106056111050000 is an apocalyptic number.
106056111050000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106056111050000 is an abundant number, since it is smaller than the sum of its proper divisors (150782094323092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106056111050000 is an frugal number, since it uses more digits than its factorization.
106056111050000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2121122254 (or 2121122228 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 26.
It can be divided in two parts, 10605611 and 1050000, that added together give a palindrome (11655611).
The spelling of 106056111050000 in words is "one hundred six trillion, fifty-six billion, one hundred eleven million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •