Base | Representation |
---|---|
bin | 110001011000101100… |
… | …0001111000001000111 |
3 | 101010202011110002100012 |
4 | 1202301120033001013 |
5 | 3214200103312203 |
6 | 120415425340435 |
7 | 10443100530125 |
oct | 1426130170107 |
9 | 333664402305 |
10 | 106055135303 |
11 | 40a833a4957 |
12 | 1867979771b |
13 | a002141140 |
14 | 51c1302915 |
15 | 2b5ab13bd8 |
hex | 18b160f047 |
106055135303 has 16 divisors (see below), whose sum is σ = 114887101056. Its totient is φ = 97320515040.
The previous prime is 106055135281. The next prime is 106055135311. The reversal of 106055135303 is 303531550601.
It is a cyclic number.
It is not a de Polignac number, because 106055135303 - 210 = 106055134279 is a prime.
It is a super-2 number, since 2×1060551353032 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106055135303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106055135393) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2400176 + ... + 2443962.
It is an arithmetic number, because the mean of its divisors is an integer number (7180443816).
Almost surely, 2106055135303 is an apocalyptic number.
106055135303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106055135303 is a deficient number, since it is larger than the sum of its proper divisors (8831965753).
106055135303 is a wasteful number, since it uses less digits than its factorization.
106055135303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44894.
The product of its (nonzero) digits is 20250, while the sum is 32.
Adding to 106055135303 its reverse (303531550601), we get a palindrome (409586685904).
The spelling of 106055135303 in words is "one hundred six billion, fifty-five million, one hundred thirty-five thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •