Base | Representation |
---|---|
bin | 11000000111010100011100… |
… | …110100110100110100001111 |
3 | 111220111212100201200202102221 |
4 | 120013110130310310310033 |
5 | 102400110403412044444 |
6 | 1013321301012200211 |
7 | 31224205204541455 |
oct | 3007243464646417 |
9 | 456455321622387 |
10 | 106056111049999 |
11 | 3087a1648a0a20 |
12 | ba8a475009067 |
13 | 4724082323776 |
14 | 1c29200baa9d5 |
15 | c3db6986da84 |
hex | 60751cd34d0f |
106056111049999 has 64 divisors (see below), whose sum is σ = 125825633280000. Its totient is φ = 88316317900800.
The previous prime is 106056111049957. The next prime is 106056111050161. The reversal of 106056111049999 is 999940111650601.
It is not a de Polignac number, because 106056111049999 - 29 = 106056111049487 is a prime.
It is a super-2 number, since 2×1060561110499992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106056111149999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1472986002 + ... + 1473058000.
It is an arithmetic number, because the mean of its divisors is an integer number (1966025520000).
Almost surely, 2106056111049999 is an apocalyptic number.
106056111049999 is a deficient number, since it is larger than the sum of its proper divisors (19769522230001).
106056111049999 is a wasteful number, since it uses less digits than its factorization.
106056111049999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73504.
The product of its (nonzero) digits is 4723920, while the sum is 61.
The spelling of 106056111049999 in words is "one hundred six trillion, fifty-six billion, one hundred eleven million, forty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •