Base | Representation |
---|---|
bin | 110001011000101000… |
… | …1110111001010101110 |
3 | 101010202001022012202212 |
4 | 1202301101313022232 |
5 | 3214144141333000 |
6 | 120415325450422 |
7 | 10443050401532 |
oct | 1426121671256 |
9 | 333661265685 |
10 | 106053464750 |
11 | 40a82463832 |
12 | 18679110a12 |
13 | a0019a794c |
14 | 51c0dc9bc2 |
15 | 2b5a8d3c35 |
hex | 18b14772ae |
106053464750 has 16 divisors (see below), whose sum is σ = 198532086480. Its totient is φ = 42421385800.
The previous prime is 106053464701. The next prime is 106053464753. The reversal of 106053464750 is 57464350601.
It is a super-2 number, since 2×1060534647502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106053464698 and 106053464707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106053464753) 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 7 ways as a sum of consecutive naturals, for example, 212106680 + ... + 212107179.
It is an arithmetic number, because the mean of its divisors is an integer number (12408255405).
Almost surely, 2106053464750 is an apocalyptic number.
106053464750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106053464750 is a deficient number, since it is larger than the sum of its proper divisors (92478621730).
106053464750 is an equidigital number, since it uses as much as digits as its factorization.
106053464750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424213876 (or 424213866 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 41.
The spelling of 106053464750 in words is "one hundred six billion, fifty-three million, four hundred sixty-four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •