Base | Representation |
---|---|
bin | 110001011001111000… |
… | …1010111100001000001 |
3 | 101010211221222112222010 |
4 | 1202303301113201001 |
5 | 3214240342400040 |
6 | 120423422003133 |
7 | 10444065661503 |
oct | 1426361274101 |
9 | 333757875863 |
10 | 106095278145 |
11 | 40aa402285a |
12 | 1868b1164a9 |
13 | a00a5579bc |
14 | 51c6791d73 |
15 | 2b5e3e2e80 |
hex | 18b3c57841 |
106095278145 has 16 divisors (see below), whose sum is σ = 169801632000. Its totient is φ = 56567752704.
The previous prime is 106095278141. The next prime is 106095278161. The reversal of 106095278145 is 541872590601.
It is a happy number.
It is not a de Polignac number, because 106095278145 - 22 = 106095278141 is a prime.
It is a super-2 number, since 2×1060952781452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106095278094 and 106095278103.
It is not an unprimeable number, because it can be changed into a prime (106095278141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 971145 + ... + 1074854.
It is an arithmetic number, because the mean of its divisors is an integer number (10612602000).
Almost surely, 2106095278145 is an apocalyptic number.
106095278145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106095278145 is a deficient number, since it is larger than the sum of its proper divisors (63706353855).
106095278145 is a wasteful number, since it uses less digits than its factorization.
106095278145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2049464.
The product of its (nonzero) digits is 604800, while the sum is 48.
The spelling of 106095278145 in words is "one hundred six billion, ninety-five million, two hundred seventy-eight thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •