Base | Representation |
---|---|
bin | 110001011000010101… |
… | …0001011101101011101 |
3 | 101010201022201202102210 |
4 | 1202300222023231131 |
5 | 3214134011010013 |
6 | 120414314511033 |
7 | 10442563110240 |
oct | 1426052135535 |
9 | 333638652383 |
10 | 106043063133 |
11 | 40a775a9957 |
12 | 18675735479 |
13 | 9ccc7a5347 |
14 | 51bd87d257 |
15 | 2b59a2bcc3 |
hex | 18b0a8bb5d |
106043063133 has 16 divisors (see below), whose sum is σ = 161630289920. Its totient is φ = 60580713456.
The previous prime is 106043063129. The next prime is 106043063197. The reversal of 106043063133 is 331360340601.
It is not a de Polignac number, because 106043063133 - 22 = 106043063129 is a prime.
It is a super-2 number, since 2×1060430631332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 106043063133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106043062133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 553153 + ... + 719766.
It is an arithmetic number, because the mean of its divisors is an integer number (10101893120).
Almost surely, 2106043063133 is an apocalyptic number.
It is an amenable number.
106043063133 is a deficient number, since it is larger than the sum of its proper divisors (55587226787).
106043063133 is a wasteful number, since it uses less digits than its factorization.
106043063133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276896.
The product of its (nonzero) digits is 11664, while the sum is 30.
The spelling of 106043063133 in words is "one hundred six billion, forty-three million, sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •