Base | Representation |
---|---|
bin | 110001101111110010… |
… | …0100010011010110100 |
3 | 101012202011201000002222 |
4 | 1203133210202122310 |
5 | 3222242002044221 |
6 | 121024352021512 |
7 | 10501230654515 |
oct | 1433744423264 |
9 | 335664630088 |
10 | 106830112436 |
11 | 413408a4723 |
12 | 18855231898 |
13 | a0c68725a8 |
14 | 52561d6a0c |
15 | 2ba3b969ab |
hex | 18df9226b4 |
106830112436 has 12 divisors (see below), whose sum is σ = 186968594820. Its totient is φ = 53410513920.
The previous prime is 106830112427. The next prime is 106830112439. The reversal of 106830112436 is 634211038601.
It can be written as a sum of positive squares in 2 ways, for example, as 26085480100 + 80744632336 = 161510^2 + 284156^2 .
It is a super-2 number, since 2×1068301124362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106830112396 and 106830112405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106830112439) 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 3 ways as a sum of consecutive naturals, for example, 1082381 + ... + 1176948.
It is an arithmetic number, because the mean of its divisors is an integer number (15580716235).
Almost surely, 2106830112436 is an apocalyptic number.
It is an amenable number.
106830112436 is a deficient number, since it is larger than the sum of its proper divisors (80138482384).
106830112436 is a wasteful number, since it uses less digits than its factorization.
106830112436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2271154 (or 2271152 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 106830112436 in words is "one hundred six billion, eight hundred thirty million, one hundred twelve thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •