Base | Representation |
---|---|
bin | 110001011010000010… |
… | …1011110101101110001 |
3 | 101010212022220102022000 |
4 | 1202310011132231301 |
5 | 3214243220104023 |
6 | 120424131004213 |
7 | 10444161541026 |
oct | 1426405365561 |
9 | 333768812260 |
10 | 106100550513 |
11 | 40aa6aa3a91 |
12 | 18690a39669 |
13 | a00b682749 |
14 | 51c736554d |
15 | 2b5ead5243 |
hex | 18b415eb71 |
106100550513 has 32 divisors (see below), whose sum is σ = 159571555200. Its totient is φ = 69666398208.
The previous prime is 106100550511. The next prime is 106100550533. The reversal of 106100550513 is 315055001601.
106100550513 is a `hidden beast` number, since 1 + 0 + 6 + 100 + 550 + 5 + 1 + 3 = 666.
It is not a de Polignac number, because 106100550513 - 21 = 106100550511 is a prime.
It is a super-2 number, since 2×1061005505132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (106100550511) 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 31 ways as a sum of consecutive naturals, for example, 531670 + ... + 703472.
It is an arithmetic number, because the mean of its divisors is an integer number (4986611100).
Almost surely, 2106100550513 is an apocalyptic number.
It is an amenable number.
106100550513 is a deficient number, since it is larger than the sum of its proper divisors (53471004687).
106100550513 is a wasteful number, since it uses less digits than its factorization.
106100550513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172158 (or 172152 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 106100550513 in words is "one hundred six billion, one hundred million, five hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •